./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label32_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_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/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 01168fbb381348520b892fee62d1bbd6a25fcfcb ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 14:56:58,931 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:56:58,932 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:56:58,938 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:56:58,938 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:56:58,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:56:58,939 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:56:58,940 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:56:58,941 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:56:58,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:56:58,942 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:56:58,942 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:56:58,942 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:56:58,943 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:56:58,943 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:56:58,944 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:56:58,944 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:56:58,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:56:58,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:56:58,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:56:58,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:56:58,948 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:56:58,949 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:56:58,949 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:56:58,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:56:58,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:56:58,950 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:56:58,950 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:56:58,951 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:56:58,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:56:58,951 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:56:58,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:56:58,952 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:56:58,952 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:56:58,952 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:56:58,953 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:56:58,953 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 14:56:58,960 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:56:58,960 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:56:58,960 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:56:58,961 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:56:58,961 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:56:58,961 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:56:58,961 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:56:58,961 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:56:58,961 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:56:58,961 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:56:58,961 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:56:58,961 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:56:58,961 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:56:58,962 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:56:58,962 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:56:58,962 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:56:58,962 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:56:58,962 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:56:58,962 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:56:58,962 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:56:58,962 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:56:58,962 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:56:58,962 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:56:58,962 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:56:58,963 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:56:58,963 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:56:58,963 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:56:58,963 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:56:58,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:56:58,963 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:56:58,963 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:56:58,963 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:56:58,963 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:56:58,963 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:56:58,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:56:58,964 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 14:56:58,964 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/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 -> 01168fbb381348520b892fee62d1bbd6a25fcfcb [2018-12-02 14:56:58,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:56:58,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:56:58,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:56:58,989 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:56:58,989 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:56:58,990 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c [2018-12-02 14:56:59,023 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/data/2988651cb/494ac4ebd4ab47dcbbb55616fe237c5e/FLAG87fad82ab [2018-12-02 14:56:59,461 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:56:59,462 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c [2018-12-02 14:56:59,469 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/data/2988651cb/494ac4ebd4ab47dcbbb55616fe237c5e/FLAG87fad82ab [2018-12-02 14:56:59,477 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/data/2988651cb/494ac4ebd4ab47dcbbb55616fe237c5e [2018-12-02 14:56:59,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:56:59,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:56:59,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:56:59,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:56:59,483 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:56:59,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:56:59" (1/1) ... [2018-12-02 14:56:59,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:59, skipping insertion in model container [2018-12-02 14:56:59,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:56:59" (1/1) ... [2018-12-02 14:56:59,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:56:59,513 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:56:59,690 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:56:59,693 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:56:59,780 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:56:59,790 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:56:59,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:59 WrapperNode [2018-12-02 14:56:59,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:56:59,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:56:59,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:56:59,791 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:56:59,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:59" (1/1) ... [2018-12-02 14:56:59,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:59" (1/1) ... [2018-12-02 14:56:59,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:56:59,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:56:59,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:56:59,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:56:59,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:59" (1/1) ... [2018-12-02 14:56:59,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:59" (1/1) ... [2018-12-02 14:56:59,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:59" (1/1) ... [2018-12-02 14:56:59,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:59" (1/1) ... [2018-12-02 14:56:59,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:59" (1/1) ... [2018-12-02 14:56:59,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:59" (1/1) ... [2018-12-02 14:56:59,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:59" (1/1) ... [2018-12-02 14:56:59,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:56:59,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:56:59,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:56:59,850 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:56:59,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:56:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:56:59,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:56:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-02 14:56:59,891 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-02 14:56:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:56:59,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:56:59,892 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:56:59,892 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:57:00,450 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:57:00,450 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 14:57:00,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:57:00 BoogieIcfgContainer [2018-12-02 14:57:00,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:57:00,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:57:00,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:57:00,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:57:00,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:56:59" (1/3) ... [2018-12-02 14:57:00,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1defa1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:57:00, skipping insertion in model container [2018-12-02 14:57:00,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:59" (2/3) ... [2018-12-02 14:57:00,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1defa1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:57:00, skipping insertion in model container [2018-12-02 14:57:00,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:57:00" (3/3) ... [2018-12-02 14:57:00,455 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label32_false-unreach-call_false-termination.c [2018-12-02 14:57:00,461 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:57:00,466 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 14:57:00,476 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 14:57:00,497 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:57:00,497 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:57:00,497 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:57:00,497 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:57:00,497 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:57:00,497 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:57:00,497 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:57:00,497 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:57:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-12-02 14:57:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 14:57:00,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:00,516 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] [2018-12-02 14:57:00,518 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:00,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:00,521 INFO L82 PathProgramCache]: Analyzing trace with hash 312324590, now seen corresponding path program 1 times [2018-12-02 14:57:00,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:00,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:00,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:00,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:00,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:00,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:57:00,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:57:00,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:57:00,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:57:00,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:57:00,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:57:00,751 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2018-12-02 14:57:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:01,184 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2018-12-02 14:57:01,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:57:01,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-02 14:57:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:01,193 INFO L225 Difference]: With dead ends: 547 [2018-12-02 14:57:01,193 INFO L226 Difference]: Without dead ends: 278 [2018-12-02 14:57:01,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:57:01,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-02 14:57:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-12-02 14:57:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-02 14:57:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 394 transitions. [2018-12-02 14:57:01,232 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 394 transitions. Word has length 80 [2018-12-02 14:57:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:01,232 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 394 transitions. [2018-12-02 14:57:01,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:57:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 394 transitions. [2018-12-02 14:57:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 14:57:01,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:01,234 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] [2018-12-02 14:57:01,235 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:01,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:01,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2042606981, now seen corresponding path program 1 times [2018-12-02 14:57:01,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:01,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:01,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:01,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:01,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:01,300 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-02 14:57:01,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:57:01,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:57:01,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:57:01,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:57:01,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:57:01,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:57:01,302 INFO L87 Difference]: Start difference. First operand 278 states and 394 transitions. Second operand 6 states. [2018-12-02 14:57:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:01,677 INFO L93 Difference]: Finished difference Result 840 states and 1222 transitions. [2018-12-02 14:57:01,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:57:01,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2018-12-02 14:57:01,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:01,682 INFO L225 Difference]: With dead ends: 840 [2018-12-02 14:57:01,682 INFO L226 Difference]: Without dead ends: 568 [2018-12-02 14:57:01,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:57:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-12-02 14:57:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 556. [2018-12-02 14:57:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-12-02 14:57:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 785 transitions. [2018-12-02 14:57:01,711 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 785 transitions. Word has length 90 [2018-12-02 14:57:01,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:01,712 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 785 transitions. [2018-12-02 14:57:01,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:57:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 785 transitions. [2018-12-02 14:57:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 14:57:01,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:01,713 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] [2018-12-02 14:57:01,713 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:01,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:01,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2007117511, now seen corresponding path program 1 times [2018-12-02 14:57:01,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:01,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:01,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:01,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:01,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:01,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:01,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:01,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:57:01,801 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 92 with the following transitions: [2018-12-02 14:57:01,802 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], [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], [285], [287], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 14:57:01,827 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:57:01,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:57:02,135 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:57:02,136 INFO L272 AbstractInterpreter]: Visited 83 different actions 159 times. Merged at 3 different actions 3 times. Never widened. Performed 2446 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2446 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-02 14:57:02,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:02,141 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:57:02,305 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 81.02% of their original sizes. [2018-12-02 14:57:02,305 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:57:02,357 INFO L418 sIntCurrentIteration]: We unified 90 AI predicates to 90 [2018-12-02 14:57:02,357 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:57:02,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:57:02,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-12-02 14:57:02,358 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:57:02,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 14:57:02,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 14:57:02,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:57:02,359 INFO L87 Difference]: Start difference. First operand 556 states and 785 transitions. Second operand 10 states. [2018-12-02 14:57:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:05,467 INFO L93 Difference]: Finished difference Result 1758 states and 2511 transitions. [2018-12-02 14:57:05,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 14:57:05,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-12-02 14:57:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:05,471 INFO L225 Difference]: With dead ends: 1758 [2018-12-02 14:57:05,471 INFO L226 Difference]: Without dead ends: 1208 [2018-12-02 14:57:05,472 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 100 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-12-02 14:57:05,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2018-12-02 14:57:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 695. [2018-12-02 14:57:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-12-02 14:57:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 936 transitions. [2018-12-02 14:57:05,495 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 936 transitions. Word has length 91 [2018-12-02 14:57:05,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:05,495 INFO L480 AbstractCegarLoop]: Abstraction has 695 states and 936 transitions. [2018-12-02 14:57:05,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 14:57:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 936 transitions. [2018-12-02 14:57:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 14:57:05,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:05,498 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:05,499 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:05,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1181815812, now seen corresponding path program 1 times [2018-12-02 14:57:05,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:05,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:05,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:05,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:05,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:05,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:05,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:57:05,572 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 104 with the following transitions: [2018-12-02 14:57:05,572 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [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], [285], [287], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 14:57:05,575 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:57:05,575 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:57:05,677 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:57:05,678 INFO L272 AbstractInterpreter]: Visited 84 different actions 162 times. Merged at 4 different actions 4 times. Never widened. Performed 2349 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2349 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-02 14:57:05,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:05,679 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:57:05,754 INFO L227 lantSequenceWeakener]: Weakened 100 states. On average, predicates are now at 81.06% of their original sizes. [2018-12-02 14:57:05,755 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:57:05,784 INFO L418 sIntCurrentIteration]: We unified 102 AI predicates to 102 [2018-12-02 14:57:05,784 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:57:05,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:57:05,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-02 14:57:05,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:57:05,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 14:57:05,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 14:57:05,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:57:05,785 INFO L87 Difference]: Start difference. First operand 695 states and 936 transitions. Second operand 10 states. [2018-12-02 14:57:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:07,251 INFO L93 Difference]: Finished difference Result 1658 states and 2199 transitions. [2018-12-02 14:57:07,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 14:57:07,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-12-02 14:57:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:07,253 INFO L225 Difference]: With dead ends: 1658 [2018-12-02 14:57:07,253 INFO L226 Difference]: Without dead ends: 969 [2018-12-02 14:57:07,254 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 110 GetRequests, 94 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-02 14:57:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-12-02 14:57:07,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 967. [2018-12-02 14:57:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2018-12-02 14:57:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1233 transitions. [2018-12-02 14:57:07,268 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1233 transitions. Word has length 103 [2018-12-02 14:57:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:07,268 INFO L480 AbstractCegarLoop]: Abstraction has 967 states and 1233 transitions. [2018-12-02 14:57:07,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 14:57:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1233 transitions. [2018-12-02 14:57:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-02 14:57:07,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:07,270 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-12-02 14:57:07,270 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:07,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:07,270 INFO L82 PathProgramCache]: Analyzing trace with hash -613207285, now seen corresponding path program 1 times [2018-12-02 14:57:07,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:07,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:07,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:07,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:07,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 14:57:07,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:07,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:57:07,309 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-12-02 14:57:07,309 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [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], [285], [287], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 14:57:07,312 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:57:07,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:57:07,445 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:57:07,445 INFO L272 AbstractInterpreter]: Visited 85 different actions 252 times. Merged at 6 different actions 17 times. Never widened. Performed 3780 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3780 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-02 14:57:07,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:07,449 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:57:07,563 INFO L227 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 82.85% of their original sizes. [2018-12-02 14:57:07,563 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:57:07,590 INFO L418 sIntCurrentIteration]: We unified 113 AI predicates to 113 [2018-12-02 14:57:07,590 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:57:07,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:57:07,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-12-02 14:57:07,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:57:07,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:57:07,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:57:07,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:57:07,591 INFO L87 Difference]: Start difference. First operand 967 states and 1233 transitions. Second operand 9 states. [2018-12-02 14:57:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:09,518 INFO L93 Difference]: Finished difference Result 1956 states and 2582 transitions. [2018-12-02 14:57:09,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 14:57:09,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2018-12-02 14:57:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:09,521 INFO L225 Difference]: With dead ends: 1956 [2018-12-02 14:57:09,521 INFO L226 Difference]: Without dead ends: 1267 [2018-12-02 14:57:09,522 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 120 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-12-02 14:57:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2018-12-02 14:57:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1249. [2018-12-02 14:57:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2018-12-02 14:57:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1572 transitions. [2018-12-02 14:57:09,550 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1572 transitions. Word has length 114 [2018-12-02 14:57:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:09,550 INFO L480 AbstractCegarLoop]: Abstraction has 1249 states and 1572 transitions. [2018-12-02 14:57:09,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:57:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1572 transitions. [2018-12-02 14:57:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-02 14:57:09,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:09,553 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:09,553 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:09,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:09,553 INFO L82 PathProgramCache]: Analyzing trace with hash 484628234, now seen corresponding path program 1 times [2018-12-02 14:57:09,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:09,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:09,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:09,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:09,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 55 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-02 14:57:09,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:09,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:57:09,605 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2018-12-02 14:57:09,605 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [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], [285], [287], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 14:57:09,608 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:57:09,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:57:09,857 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:57:09,857 INFO L272 AbstractInterpreter]: Visited 87 different actions 431 times. Merged at 8 different actions 39 times. Widened at 1 different actions 1 times. Performed 6861 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6861 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-02 14:57:09,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:09,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:57:09,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:09,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:57:09,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:09,867 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:57:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:09,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 55 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-02 14:57:09,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:57:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 55 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-02 14:57:10,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:57:10,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-12-02 14:57:10,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:57:10,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 14:57:10,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 14:57:10,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-02 14:57:10,043 INFO L87 Difference]: Start difference. First operand 1249 states and 1572 transitions. Second operand 8 states. [2018-12-02 14:57:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:11,475 INFO L93 Difference]: Finished difference Result 4031 states and 5276 transitions. [2018-12-02 14:57:11,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 14:57:11,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2018-12-02 14:57:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:11,481 INFO L225 Difference]: With dead ends: 4031 [2018-12-02 14:57:11,481 INFO L226 Difference]: Without dead ends: 2633 [2018-12-02 14:57:11,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2018-12-02 14:57:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2018-12-02 14:57:11,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2617. [2018-12-02 14:57:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2617 states. [2018-12-02 14:57:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 3035 transitions. [2018-12-02 14:57:11,518 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 3035 transitions. Word has length 133 [2018-12-02 14:57:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:11,518 INFO L480 AbstractCegarLoop]: Abstraction has 2617 states and 3035 transitions. [2018-12-02 14:57:11,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 14:57:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 3035 transitions. [2018-12-02 14:57:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 14:57:11,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:11,521 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:11,521 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:11,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:11,522 INFO L82 PathProgramCache]: Analyzing trace with hash 167001349, now seen corresponding path program 1 times [2018-12-02 14:57:11,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:11,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:11,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:11,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:11,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 84 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 14:57:11,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:11,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:57:11,598 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-12-02 14:57:11,598 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [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], [285], [287], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 14:57:11,600 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:57:11,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:57:11,674 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:57:11,674 INFO L272 AbstractInterpreter]: Visited 85 different actions 164 times. Merged at 4 different actions 4 times. Never widened. Performed 2410 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2410 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-02 14:57:11,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:11,677 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:57:11,800 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 81.22% of their original sizes. [2018-12-02 14:57:11,800 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:57:11,834 INFO L418 sIntCurrentIteration]: We unified 155 AI predicates to 155 [2018-12-02 14:57:11,834 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:57:11,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:57:11,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-02 14:57:11,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:57:11,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 14:57:11,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 14:57:11,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:57:11,835 INFO L87 Difference]: Start difference. First operand 2617 states and 3035 transitions. Second operand 10 states. [2018-12-02 14:57:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:13,799 INFO L93 Difference]: Finished difference Result 5232 states and 6130 transitions. [2018-12-02 14:57:13,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 14:57:13,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2018-12-02 14:57:13,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:13,806 INFO L225 Difference]: With dead ends: 5232 [2018-12-02 14:57:13,807 INFO L226 Difference]: Without dead ends: 2893 [2018-12-02 14:57:13,810 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 164 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-02 14:57:13,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2018-12-02 14:57:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2891. [2018-12-02 14:57:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2891 states. [2018-12-02 14:57:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 3332 transitions. [2018-12-02 14:57:13,848 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 3332 transitions. Word has length 156 [2018-12-02 14:57:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:13,848 INFO L480 AbstractCegarLoop]: Abstraction has 2891 states and 3332 transitions. [2018-12-02 14:57:13,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 14:57:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 3332 transitions. [2018-12-02 14:57:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 14:57:13,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:13,851 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:13,851 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:13,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:13,852 INFO L82 PathProgramCache]: Analyzing trace with hash 644016480, now seen corresponding path program 1 times [2018-12-02 14:57:13,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:13,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:13,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:13,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:13,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 81 proven. 40 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 14:57:13,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:13,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:57:13,973 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-12-02 14:57:13,973 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [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], [285], [287], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 14:57:13,975 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:57:13,975 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:57:14,164 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:57:14,165 INFO L272 AbstractInterpreter]: Visited 87 different actions 349 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Performed 5323 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5323 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-02 14:57:14,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:14,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:57:14,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:14,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:57:14,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:14,176 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:57:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:14,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 98 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 14:57:14,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:57:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 86 proven. 33 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-02 14:57:14,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:57:14,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-02 14:57:14,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:57:14,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 14:57:14,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 14:57:14,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-02 14:57:14,319 INFO L87 Difference]: Start difference. First operand 2891 states and 3332 transitions. Second operand 11 states. [2018-12-02 14:57:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:15,246 INFO L93 Difference]: Finished difference Result 9392 states and 11325 transitions. [2018-12-02 14:57:15,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:57:15,247 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 164 [2018-12-02 14:57:15,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:15,263 INFO L225 Difference]: With dead ends: 9392 [2018-12-02 14:57:15,263 INFO L226 Difference]: Without dead ends: 6916 [2018-12-02 14:57:15,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 331 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-02 14:57:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6916 states. [2018-12-02 14:57:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6916 to 6370. [2018-12-02 14:57:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6370 states. [2018-12-02 14:57:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6370 states to 6370 states and 7478 transitions. [2018-12-02 14:57:15,343 INFO L78 Accepts]: Start accepts. Automaton has 6370 states and 7478 transitions. Word has length 164 [2018-12-02 14:57:15,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:15,343 INFO L480 AbstractCegarLoop]: Abstraction has 6370 states and 7478 transitions. [2018-12-02 14:57:15,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 14:57:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 6370 states and 7478 transitions. [2018-12-02 14:57:15,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 14:57:15,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:15,348 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:15,348 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:15,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:15,348 INFO L82 PathProgramCache]: Analyzing trace with hash -200976544, now seen corresponding path program 1 times [2018-12-02 14:57:15,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:15,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:15,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:15,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:15,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 101 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 14:57:15,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:15,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:57:15,441 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-12-02 14:57:15,442 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [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], [285], [287], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 14:57:15,444 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:57:15,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:57:15,575 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:57:15,575 INFO L272 AbstractInterpreter]: Visited 86 different actions 250 times. Merged at 6 different actions 12 times. Never widened. Performed 3584 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3584 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-02 14:57:15,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:15,576 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:57:15,773 INFO L227 lantSequenceWeakener]: Weakened 170 states. On average, predicates are now at 82.72% of their original sizes. [2018-12-02 14:57:15,773 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:57:15,798 INFO L418 sIntCurrentIteration]: We unified 172 AI predicates to 172 [2018-12-02 14:57:15,799 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:57:15,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:57:15,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-02 14:57:15,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:57:15,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:57:15,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:57:15,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:57:15,799 INFO L87 Difference]: Start difference. First operand 6370 states and 7478 transitions. Second operand 9 states. [2018-12-02 14:57:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:17,156 INFO L93 Difference]: Finished difference Result 12882 states and 15200 transitions. [2018-12-02 14:57:17,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 14:57:17,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 173 [2018-12-02 14:57:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:17,167 INFO L225 Difference]: With dead ends: 12882 [2018-12-02 14:57:17,167 INFO L226 Difference]: Without dead ends: 7064 [2018-12-02 14:57:17,171 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 178 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-12-02 14:57:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7064 states. [2018-12-02 14:57:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7064 to 7059. [2018-12-02 14:57:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7059 states. [2018-12-02 14:57:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7059 states to 7059 states and 8252 transitions. [2018-12-02 14:57:17,242 INFO L78 Accepts]: Start accepts. Automaton has 7059 states and 8252 transitions. Word has length 173 [2018-12-02 14:57:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:17,242 INFO L480 AbstractCegarLoop]: Abstraction has 7059 states and 8252 transitions. [2018-12-02 14:57:17,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:57:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 7059 states and 8252 transitions. [2018-12-02 14:57:17,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 14:57:17,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:17,248 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:17,248 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:17,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:17,248 INFO L82 PathProgramCache]: Analyzing trace with hash -108710575, now seen corresponding path program 1 times [2018-12-02 14:57:17,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:17,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:17,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:17,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:17,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 101 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-02 14:57:17,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:17,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:57:17,312 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-12-02 14:57:17,313 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [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], [285], [287], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 14:57:17,314 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:57:17,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:57:17,529 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:57:17,529 INFO L272 AbstractInterpreter]: Visited 88 different actions 357 times. Merged at 9 different actions 38 times. Widened at 1 different actions 1 times. Performed 5458 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5458 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-02 14:57:17,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:17,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:57:17,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:17,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:57:17,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:17,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:57:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:17,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 124 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-02 14:57:17,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:57:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 106 proven. 20 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-02 14:57:17,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:57:17,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-12-02 14:57:17,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:57:17,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 14:57:17,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 14:57:17,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:57:17,664 INFO L87 Difference]: Start difference. First operand 7059 states and 8252 transitions. Second operand 12 states. [2018-12-02 14:57:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:19,426 INFO L93 Difference]: Finished difference Result 17142 states and 20771 transitions. [2018-12-02 14:57:19,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 14:57:19,427 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 183 [2018-12-02 14:57:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:19,448 INFO L225 Difference]: With dead ends: 17142 [2018-12-02 14:57:19,448 INFO L226 Difference]: Without dead ends: 10226 [2018-12-02 14:57:19,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 391 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=411, Invalid=1395, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 14:57:19,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10226 states. [2018-12-02 14:57:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10226 to 8709. [2018-12-02 14:57:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8709 states. [2018-12-02 14:57:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8709 states to 8709 states and 10271 transitions. [2018-12-02 14:57:19,561 INFO L78 Accepts]: Start accepts. Automaton has 8709 states and 10271 transitions. Word has length 183 [2018-12-02 14:57:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:19,561 INFO L480 AbstractCegarLoop]: Abstraction has 8709 states and 10271 transitions. [2018-12-02 14:57:19,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 14:57:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 8709 states and 10271 transitions. [2018-12-02 14:57:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-02 14:57:19,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:19,569 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:19,569 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:19,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:19,569 INFO L82 PathProgramCache]: Analyzing trace with hash -58515886, now seen corresponding path program 1 times [2018-12-02 14:57:19,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:19,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:19,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:19,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:19,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 155 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 14:57:19,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:19,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:57:19,652 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-12-02 14:57:19,652 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [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], [285], [287], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 14:57:19,653 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:57:19,653 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:57:19,857 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:57:19,858 INFO L272 AbstractInterpreter]: Visited 87 different actions 346 times. Merged at 8 different actions 31 times. Widened at 1 different actions 1 times. Performed 5419 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5419 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-02 14:57:19,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:19,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:57:19,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:19,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:57:19,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:19,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:57:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:19,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-02 14:57:19,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:57:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-02 14:57:20,010 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:57:20,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-12-02 14:57:20,011 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:57:20,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:57:20,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:57:20,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:57:20,011 INFO L87 Difference]: Start difference. First operand 8709 states and 10271 transitions. Second operand 3 states. [2018-12-02 14:57:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:20,277 INFO L93 Difference]: Finished difference Result 19088 states and 22841 transitions. [2018-12-02 14:57:20,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:57:20,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-12-02 14:57:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:20,298 INFO L225 Difference]: With dead ends: 19088 [2018-12-02 14:57:20,298 INFO L226 Difference]: Without dead ends: 11900 [2018-12-02 14:57:20,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 376 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:57:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2018-12-02 14:57:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 10242. [2018-12-02 14:57:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10242 states. [2018-12-02 14:57:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 12107 transitions. [2018-12-02 14:57:20,434 INFO L78 Accepts]: Start accepts. Automaton has 10242 states and 12107 transitions. Word has length 189 [2018-12-02 14:57:20,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:20,434 INFO L480 AbstractCegarLoop]: Abstraction has 10242 states and 12107 transitions. [2018-12-02 14:57:20,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:57:20,434 INFO L276 IsEmpty]: Start isEmpty. Operand 10242 states and 12107 transitions. [2018-12-02 14:57:20,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-02 14:57:20,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:20,441 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:20,441 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:20,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:20,442 INFO L82 PathProgramCache]: Analyzing trace with hash 76698730, now seen corresponding path program 1 times [2018-12-02 14:57:20,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:20,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:20,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:20,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:20,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 160 proven. 47 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 14:57:20,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:20,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:57:20,540 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-12-02 14:57:20,540 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [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], [285], [287], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 14:57:20,541 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:57:20,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:57:20,708 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:57:20,709 INFO L272 AbstractInterpreter]: Visited 87 different actions 342 times. Merged at 8 different actions 27 times. Never widened. Performed 5417 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5417 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-02 14:57:20,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:20,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:57:20,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:20,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/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-02 14:57:20,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:20,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:57:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:20,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 175 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-02 14:57:20,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:57:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 141 proven. 15 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-12-02 14:57:21,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:57:21,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-12-02 14:57:21,044 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:57:21,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 14:57:21,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 14:57:21,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:57:21,045 INFO L87 Difference]: Start difference. First operand 10242 states and 12107 transitions. Second operand 12 states. [2018-12-02 14:57:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:22,508 INFO L93 Difference]: Finished difference Result 20163 states and 25396 transitions. [2018-12-02 14:57:22,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 14:57:22,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 194 [2018-12-02 14:57:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:22,536 INFO L225 Difference]: With dead ends: 20163 [2018-12-02 14:57:22,536 INFO L226 Difference]: Without dead ends: 11086 [2018-12-02 14:57:22,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=1103, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 14:57:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11086 states. [2018-12-02 14:57:22,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11086 to 10375. [2018-12-02 14:57:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10375 states. [2018-12-02 14:57:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10375 states to 10375 states and 11879 transitions. [2018-12-02 14:57:22,720 INFO L78 Accepts]: Start accepts. Automaton has 10375 states and 11879 transitions. Word has length 194 [2018-12-02 14:57:22,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:22,721 INFO L480 AbstractCegarLoop]: Abstraction has 10375 states and 11879 transitions. [2018-12-02 14:57:22,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 14:57:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 10375 states and 11879 transitions. [2018-12-02 14:57:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-02 14:57:22,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:22,727 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:22,727 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:22,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:22,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2115014751, now seen corresponding path program 1 times [2018-12-02 14:57:22,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:22,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:22,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:22,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:22,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 217 proven. 73 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 14:57:22,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:22,820 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:57:22,820 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-12-02 14:57:22,820 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [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], [285], [287], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 14:57:22,821 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:57:22,821 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:57:22,997 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:57:22,997 INFO L272 AbstractInterpreter]: Visited 88 different actions 352 times. Merged at 9 different actions 33 times. Widened at 1 different actions 1 times. Performed 5629 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5629 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 4 different actions. Largest state had 42 variables. [2018-12-02 14:57:23,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:23,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:57:23,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:23,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/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-02 14:57:23,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:23,007 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:57:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:23,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 234 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-12-02 14:57:23,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:57:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 185 proven. 15 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-12-02 14:57:23,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:57:23,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-12-02 14:57:23,291 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:57:23,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 14:57:23,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 14:57:23,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:57:23,292 INFO L87 Difference]: Start difference. First operand 10375 states and 11879 transitions. Second operand 12 states. [2018-12-02 14:57:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:24,330 INFO L93 Difference]: Finished difference Result 17479 states and 20060 transitions. [2018-12-02 14:57:24,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 14:57:24,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 219 [2018-12-02 14:57:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:24,342 INFO L225 Difference]: With dead ends: 17479 [2018-12-02 14:57:24,342 INFO L226 Difference]: Without dead ends: 8055 [2018-12-02 14:57:24,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 14:57:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8055 states. [2018-12-02 14:57:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8055 to 7910. [2018-12-02 14:57:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7910 states. [2018-12-02 14:57:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7910 states to 7910 states and 8829 transitions. [2018-12-02 14:57:24,454 INFO L78 Accepts]: Start accepts. Automaton has 7910 states and 8829 transitions. Word has length 219 [2018-12-02 14:57:24,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:24,455 INFO L480 AbstractCegarLoop]: Abstraction has 7910 states and 8829 transitions. [2018-12-02 14:57:24,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 14:57:24,455 INFO L276 IsEmpty]: Start isEmpty. Operand 7910 states and 8829 transitions. [2018-12-02 14:57:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-12-02 14:57:24,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:24,459 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 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] [2018-12-02 14:57:24,459 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:24,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:24,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1776483927, now seen corresponding path program 1 times [2018-12-02 14:57:24,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:24,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:24,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:24,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:24,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 237 proven. 2 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-12-02 14:57:24,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:24,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:57:24,581 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2018-12-02 14:57:24,581 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [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], [285], [287], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 14:57:24,582 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:57:24,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:57:24,755 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:57:24,756 INFO L272 AbstractInterpreter]: Visited 88 different actions 353 times. Merged at 9 different actions 34 times. Widened at 1 different actions 1 times. Performed 5467 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5467 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 4 different actions. Largest state had 42 variables. [2018-12-02 14:57:24,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:24,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:57:24,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:24,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:57:24,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:24,763 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:57:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:24,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 237 proven. 2 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-12-02 14:57:24,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:57:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 237 proven. 2 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-12-02 14:57:25,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:57:25,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-12-02 14:57:25,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:57:25,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:57:25,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:57:25,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-02 14:57:25,011 INFO L87 Difference]: Start difference. First operand 7910 states and 8829 transitions. Second operand 9 states. [2018-12-02 14:57:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:25,579 INFO L93 Difference]: Finished difference Result 13890 states and 15625 transitions. [2018-12-02 14:57:25,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 14:57:25,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 247 [2018-12-02 14:57:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:25,589 INFO L225 Difference]: With dead ends: 13890 [2018-12-02 14:57:25,589 INFO L226 Difference]: Without dead ends: 7352 [2018-12-02 14:57:25,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 497 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-12-02 14:57:25,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7352 states. [2018-12-02 14:57:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7352 to 6518. [2018-12-02 14:57:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6518 states. [2018-12-02 14:57:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6518 states to 6518 states and 7174 transitions. [2018-12-02 14:57:25,668 INFO L78 Accepts]: Start accepts. Automaton has 6518 states and 7174 transitions. Word has length 247 [2018-12-02 14:57:25,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:25,668 INFO L480 AbstractCegarLoop]: Abstraction has 6518 states and 7174 transitions. [2018-12-02 14:57:25,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:57:25,668 INFO L276 IsEmpty]: Start isEmpty. Operand 6518 states and 7174 transitions. [2018-12-02 14:57:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-02 14:57:25,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:25,673 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:25,674 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:25,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:25,674 INFO L82 PathProgramCache]: Analyzing trace with hash 292172842, now seen corresponding path program 1 times [2018-12-02 14:57:25,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:57:25,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:25,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:25,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:57:25,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:57:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:57:25,762 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 14:57:25,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:57:25 BoogieIcfgContainer [2018-12-02 14:57:25,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:57:25,831 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:57:25,831 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:57:25,831 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:57:25,832 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:57:00" (3/4) ... [2018-12-02 14:57:25,833 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 14:57:25,920 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ad07ee74-d7e0-4017-a8cf-42c234ee1537/bin-2019/utaipan/witness.graphml [2018-12-02 14:57:25,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:57:25,921 INFO L168 Benchmark]: Toolchain (without parser) took 26441.31 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 942.7 MB in the beginning and 1.2 GB in the end (delta: -290.9 MB). Peak memory consumption was 978.4 MB. Max. memory is 11.5 GB. [2018-12-02 14:57:25,922 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:57:25,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -150.3 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-12-02 14:57:25,922 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:57:25,922 INFO L168 Benchmark]: Boogie Preprocessor took 40.28 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-02 14:57:25,922 INFO L168 Benchmark]: RCFGBuilder took 600.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 976.3 MB in the end (delta: 100.5 MB). Peak memory consumption was 100.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:57:25,923 INFO L168 Benchmark]: TraceAbstraction took 25379.86 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 970.9 MB in the beginning and 1.3 GB in the end (delta: -317.0 MB). Peak memory consumption was 847.4 MB. Max. memory is 11.5 GB. [2018-12-02 14:57:25,923 INFO L168 Benchmark]: Witness Printer took 89.24 ms. Allocated memory is still 2.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 54.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 11.5 GB. [2018-12-02 14:57:25,924 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -150.3 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.28 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 600.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 976.3 MB in the end (delta: 100.5 MB). Peak memory consumption was 100.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25379.86 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 970.9 MB in the beginning and 1.3 GB in the end (delta: -317.0 MB). Peak memory consumption was 847.4 MB. Max. memory is 11.5 GB. * Witness Printer took 89.24 ms. Allocated memory is still 2.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 54.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 398]: 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=1, 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)=1, 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)=1, 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=1, 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)=1, 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=1, 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)=1, 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=1, 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)=1, 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=1, 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)=1, 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=1, 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)=1, 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=1, 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)=1, 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=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((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)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, \result=26, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, 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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=1, 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=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L149] a16 = 4 [L150] a17 = 0 [L151] return 25; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=4, \result=25, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, 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=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, calculate_output(input)=25, 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=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, output=25, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND TRUE (((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)) [L130] a8 = 15 [L131] a17 = 0 [L132] a21 = 1 [L133] a20 = 0 [L134] a16 = 4 [L135] return -1; VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, \result=-1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a21=1, a7=1, a8=15, b=2, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=6, output=25, 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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL calculate_output(input) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L397] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] __VERIFIER_error() VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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, 25.3s OverallTime, 15 OverallIterations, 7 TraceHistogramMax, 18.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 687 SDtfs, 13964 SDslu, 1307 SDs, 0 SdLazy, 17766 SolverSat, 2714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 3602 GetRequests, 3327 SyntacticMatches, 10 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10375occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 12 AbstIntIterations, 5 AbstIntStrong, 0.9959576070204553 AbsIntWeakeningRatio, 0.30537974683544306 AbsIntAvgWeakeningVarsNumRemoved, 27.32753164556962 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 5979 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3741 NumberOfCodeBlocks, 3741 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4766 ConstructedInterpolants, 0 QuantifiedInterpolants, 1984206 SizeOfPredicates, 15 NumberOfNonLiveVariables, 4211 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 28 InterpolantComputations, 4 PerfectInterpolantSequences, 4690/5152 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...