./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label44_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_3db9200c-9aae-49d2-8bd0-c893c0b65089/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/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 eb2ed652d9060283eed99b129e3cfec21e515617 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21:40,518 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:21:40,519 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:21:40,526 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:21:40,526 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:21:40,526 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:21:40,527 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:21:40,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:21:40,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:21:40,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:21:40,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:21:40,529 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:21:40,530 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:21:40,530 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:21:40,531 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:21:40,531 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:21:40,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:21:40,533 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:21:40,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:21:40,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:21:40,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:21:40,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:21:40,537 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:21:40,537 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:21:40,537 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:21:40,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:21:40,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:21:40,538 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:21:40,539 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:21:40,539 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:21:40,539 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:21:40,540 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:21:40,540 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:21:40,540 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:21:40,540 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:21:40,541 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:21:40,541 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 14:21:40,548 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:21:40,548 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:21:40,549 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:21:40,549 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:21:40,549 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:21:40,549 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:21:40,549 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:21:40,549 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:21:40,549 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:21:40,549 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:21:40,549 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:21:40,550 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:21:40,550 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:21:40,550 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:21:40,550 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:21:40,550 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:21:40,550 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:21:40,550 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:21:40,551 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:21:40,551 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:21:40,551 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:21:40,551 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:21:40,551 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:21:40,551 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:21:40,551 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:21:40,551 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:21:40,551 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:21:40,551 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:21:40,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:21:40,552 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:21:40,552 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:21:40,552 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:21:40,552 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:21:40,552 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:21:40,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:21:40,552 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 14:21:40,552 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_3db9200c-9aae-49d2-8bd0-c893c0b65089/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 -> eb2ed652d9060283eed99b129e3cfec21e515617 [2018-12-02 14:21:40,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:21:40,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:21:40,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:21:40,579 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:21:40,579 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:21:40,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c [2018-12-02 14:21:40,614 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/bin-2019/utaipan/data/311ba9511/2d3638a33481433f9c473cb60ed4e511/FLAG39ee458cb [2018-12-02 14:21:41,069 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:21:41,070 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c [2018-12-02 14:21:41,075 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/bin-2019/utaipan/data/311ba9511/2d3638a33481433f9c473cb60ed4e511/FLAG39ee458cb [2018-12-02 14:21:41,084 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/bin-2019/utaipan/data/311ba9511/2d3638a33481433f9c473cb60ed4e511 [2018-12-02 14:21:41,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:21:41,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:21:41,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:21:41,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:21:41,089 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:21:41,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:21:41" (1/1) ... [2018-12-02 14:21:41,091 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:21:41, skipping insertion in model container [2018-12-02 14:21:41,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:21:41" (1/1) ... [2018-12-02 14:21:41,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:21:41,118 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:21:41,283 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:21:41,286 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:21:41,363 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:21:41,373 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:21:41,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:41 WrapperNode [2018-12-02 14:21:41,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:21:41,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:21:41,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:21:41,374 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:21:41,379 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:21:41" (1/1) ... [2018-12-02 14:21:41,387 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:21:41" (1/1) ... [2018-12-02 14:21:41,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:21:41,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:21:41,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:21:41,392 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:21:41,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:41" (1/1) ... [2018-12-02 14:21:41,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:41" (1/1) ... [2018-12-02 14:21:41,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:41" (1/1) ... [2018-12-02 14:21:41,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:41" (1/1) ... [2018-12-02 14:21:41,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:41" (1/1) ... [2018-12-02 14:21:41,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:41" (1/1) ... [2018-12-02 14:21:41,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:41" (1/1) ... [2018-12-02 14:21:41,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:21:41,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:21:41,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:21:41,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:21:41,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/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:21:41,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:21:41,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:21:41,459 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-02 14:21:41,459 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-02 14:21:41,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:21:41,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:21:41,459 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:21:41,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:21:42,020 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:21:42,020 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 14:21:42,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:21:42 BoogieIcfgContainer [2018-12-02 14:21:42,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:21:42,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:21:42,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:21:42,025 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:21:42,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:21:41" (1/3) ... [2018-12-02 14:21:42,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e380580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:21:42, skipping insertion in model container [2018-12-02 14:21:42,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:41" (2/3) ... [2018-12-02 14:21:42,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e380580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:21:42, skipping insertion in model container [2018-12-02 14:21:42,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:21:42" (3/3) ... [2018-12-02 14:21:42,027 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label44_false-unreach-call_false-termination.c [2018-12-02 14:21:42,036 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:21:42,042 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 14:21:42,055 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 14:21:42,075 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:21:42,075 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:21:42,076 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:21:42,076 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:21:42,076 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:21:42,076 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:21:42,076 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:21:42,076 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:21:42,090 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2018-12-02 14:21:42,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 14:21:42,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:21:42,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:21:42,099 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:21:42,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:21:42,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1767789518, now seen corresponding path program 1 times [2018-12-02 14:21:42,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:21:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:42,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:21:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:42,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:21:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:21:42,339 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:21:42,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:21:42,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:21:42,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:21:42,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:21:42,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:21:42,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:21:42,354 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2018-12-02 14:21:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:21:42,803 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-12-02 14:21:42,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:21:42,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-12-02 14:21:42,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:21:42,813 INFO L225 Difference]: With dead ends: 618 [2018-12-02 14:21:42,813 INFO L226 Difference]: Without dead ends: 320 [2018-12-02 14:21:42,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:21:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-02 14:21:42,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-02 14:21:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-02 14:21:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2018-12-02 14:21:42,858 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 94 [2018-12-02 14:21:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:21:42,859 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2018-12-02 14:21:42,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:21:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2018-12-02 14:21:42,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 14:21:42,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:21:42,863 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:21:42,863 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:21:42,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:21:42,864 INFO L82 PathProgramCache]: Analyzing trace with hash 126375849, now seen corresponding path program 1 times [2018-12-02 14:21:42,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:21:42,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:42,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:21:42,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:42,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:21:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:21:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:21:42,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:21:42,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:21:42,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:21:42,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:21:42,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:21:42,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:21:42,939 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 3 states. [2018-12-02 14:21:43,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:21:43,260 INFO L93 Difference]: Finished difference Result 931 states and 1377 transitions. [2018-12-02 14:21:43,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:21:43,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-02 14:21:43,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:21:43,263 INFO L225 Difference]: With dead ends: 931 [2018-12-02 14:21:43,263 INFO L226 Difference]: Without dead ends: 617 [2018-12-02 14:21:43,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:21:43,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-12-02 14:21:43,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 612. [2018-12-02 14:21:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-12-02 14:21:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 857 transitions. [2018-12-02 14:21:43,285 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 857 transitions. Word has length 102 [2018-12-02 14:21:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:21:43,286 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 857 transitions. [2018-12-02 14:21:43,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:21:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 857 transitions. [2018-12-02 14:21:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 14:21:43,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:21:43,289 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:21:43,289 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:21:43,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:21:43,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1061408861, now seen corresponding path program 1 times [2018-12-02 14:21:43,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:21:43,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:43,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:21:43,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:43,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:21:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:21:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:21:43,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:21:43,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:21:43,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:21:43,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:21:43,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:21:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:21:43,364 INFO L87 Difference]: Start difference. First operand 612 states and 857 transitions. Second operand 3 states. [2018-12-02 14:21:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:21:43,663 INFO L93 Difference]: Finished difference Result 1795 states and 2574 transitions. [2018-12-02 14:21:43,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:21:43,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-12-02 14:21:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:21:43,667 INFO L225 Difference]: With dead ends: 1795 [2018-12-02 14:21:43,667 INFO L226 Difference]: Without dead ends: 1189 [2018-12-02 14:21:43,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:21:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2018-12-02 14:21:43,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 901. [2018-12-02 14:21:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-02 14:21:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1208 transitions. [2018-12-02 14:21:43,687 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1208 transitions. Word has length 108 [2018-12-02 14:21:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:21:43,687 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1208 transitions. [2018-12-02 14:21:43,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:21:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1208 transitions. [2018-12-02 14:21:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-02 14:21:43,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:21:43,689 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:43,689 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:21:43,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:21:43,689 INFO L82 PathProgramCache]: Analyzing trace with hash 351599637, now seen corresponding path program 1 times [2018-12-02 14:21:43,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:21:43,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:43,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:21:43,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:43,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:21:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:21:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 14:21:43,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:21:43,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:21:43,755 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2018-12-02 14:21:43,756 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [103], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [431], [433], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-02 14:21:43,782 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:21:43,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:21:43,988 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:21:43,989 INFO L272 AbstractInterpreter]: Visited 95 different actions 95 times. Never merged. Never widened. Performed 1130 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1130 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 38 variables. [2018-12-02 14:21:43,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:21:43,993 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:21:44,176 INFO L227 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 80.48% of their original sizes. [2018-12-02 14:21:44,176 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:21:44,206 INFO L418 sIntCurrentIteration]: We unified 130 AI predicates to 130 [2018-12-02 14:21:44,206 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:21:44,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:21:44,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-12-02 14:21:44,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:21:44,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:21:44,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:21:44,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:21:44,208 INFO L87 Difference]: Start difference. First operand 901 states and 1208 transitions. Second operand 7 states. [2018-12-02 14:21:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:21:45,701 INFO L93 Difference]: Finished difference Result 1944 states and 2627 transitions. [2018-12-02 14:21:45,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:21:45,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2018-12-02 14:21:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:21:45,704 INFO L225 Difference]: With dead ends: 1944 [2018-12-02 14:21:45,704 INFO L226 Difference]: Without dead ends: 1049 [2018-12-02 14:21:45,705 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:21:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-12-02 14:21:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1047. [2018-12-02 14:21:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2018-12-02 14:21:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1362 transitions. [2018-12-02 14:21:45,719 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1362 transitions. Word has length 131 [2018-12-02 14:21:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:21:45,720 INFO L480 AbstractCegarLoop]: Abstraction has 1047 states and 1362 transitions. [2018-12-02 14:21:45,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:21:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1362 transitions. [2018-12-02 14:21:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 14:21:45,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:21:45,722 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:21:45,722 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:21:45,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:21:45,722 INFO L82 PathProgramCache]: Analyzing trace with hash 437538180, now seen corresponding path program 1 times [2018-12-02 14:21:45,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:21:45,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:45,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:21:45,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:45,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:21:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:21:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 42 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 14:21:45,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:21:45,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:21:45,799 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-12-02 14:21:45,800 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [103], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [431], [433], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-02 14:21:45,802 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:21:45,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:21:46,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:21:46,017 INFO L272 AbstractInterpreter]: Visited 100 different actions 293 times. Merged at 6 different actions 15 times. Never widened. Performed 3525 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3525 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-12-02 14:21:46,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:21:46,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:21:46,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:21:46,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/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:21:46,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:21:46,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:21:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:21:46,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:21:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 55 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 14:21:46,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:21:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 55 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 14:21:46,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:21:46,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2018-12-02 14:21:46,241 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:21:46,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 14:21:46,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 14:21:46,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:21:46,242 INFO L87 Difference]: Start difference. First operand 1047 states and 1362 transitions. Second operand 11 states. [2018-12-02 14:21:47,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:21:47,589 INFO L93 Difference]: Finished difference Result 2479 states and 3626 transitions. [2018-12-02 14:21:47,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 14:21:47,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 140 [2018-12-02 14:21:47,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:21:47,595 INFO L225 Difference]: With dead ends: 2479 [2018-12-02 14:21:47,595 INFO L226 Difference]: Without dead ends: 1438 [2018-12-02 14:21:47,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 292 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=659, Unknown=0, NotChecked=0, Total=930 [2018-12-02 14:21:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2018-12-02 14:21:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1215. [2018-12-02 14:21:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-12-02 14:21:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1475 transitions. [2018-12-02 14:21:47,632 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1475 transitions. Word has length 140 [2018-12-02 14:21:47,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:21:47,632 INFO L480 AbstractCegarLoop]: Abstraction has 1215 states and 1475 transitions. [2018-12-02 14:21:47,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 14:21:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1475 transitions. [2018-12-02 14:21:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 14:21:47,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:21:47,635 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:47,635 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:21:47,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:21:47,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1041506372, now seen corresponding path program 1 times [2018-12-02 14:21:47,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:21:47,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:47,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:21:47,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:47,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:21:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:21:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:21:47,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:21:47,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:21:47,729 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-12-02 14:21:47,729 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [431], [433], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-02 14:21:47,732 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:21:47,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:21:47,842 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:21:47,842 INFO L272 AbstractInterpreter]: Visited 98 different actions 190 times. Merged at 4 different actions 4 times. Never widened. Performed 2214 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2214 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-02 14:21:47,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:21:47,850 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:21:47,994 INFO L227 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 80.52% of their original sizes. [2018-12-02 14:21:47,994 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:21:48,041 INFO L418 sIntCurrentIteration]: We unified 172 AI predicates to 172 [2018-12-02 14:21:48,042 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:21:48,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:21:48,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-02 14:21:48,042 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:21:48,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 14:21:48,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 14:21:48,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:21:48,043 INFO L87 Difference]: Start difference. First operand 1215 states and 1475 transitions. Second operand 10 states. [2018-12-02 14:21:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:21:50,138 INFO L93 Difference]: Finished difference Result 2722 states and 3333 transitions. [2018-12-02 14:21:50,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 14:21:50,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 173 [2018-12-02 14:21:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:21:50,142 INFO L225 Difference]: With dead ends: 2722 [2018-12-02 14:21:50,142 INFO L226 Difference]: Without dead ends: 1657 [2018-12-02 14:21:50,143 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 181 GetRequests, 164 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:21:50,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2018-12-02 14:21:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1655. [2018-12-02 14:21:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2018-12-02 14:21:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 1962 transitions. [2018-12-02 14:21:50,166 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 1962 transitions. Word has length 173 [2018-12-02 14:21:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:21:50,166 INFO L480 AbstractCegarLoop]: Abstraction has 1655 states and 1962 transitions. [2018-12-02 14:21:50,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 14:21:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 1962 transitions. [2018-12-02 14:21:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-02 14:21:50,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:21:50,169 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:21:50,169 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:21:50,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:21:50,169 INFO L82 PathProgramCache]: Analyzing trace with hash 781108354, now seen corresponding path program 1 times [2018-12-02 14:21:50,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:21:50,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:50,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:21:50,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:21:50,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:21:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:21:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:21:50,237 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 14:21:50,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:21:50 BoogieIcfgContainer [2018-12-02 14:21:50,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:21:50,310 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:21:50,310 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:21:50,310 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:21:50,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:21:42" (3/4) ... [2018-12-02 14:21:50,312 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 14:21:50,400 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3db9200c-9aae-49d2-8bd0-c893c0b65089/bin-2019/utaipan/witness.graphml [2018-12-02 14:21:50,401 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:21:50,401 INFO L168 Benchmark]: Toolchain (without parser) took 9315.02 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 547.4 MB). Free memory was 945.9 MB in the beginning and 1.5 GB in the end (delta: -583.0 MB). Peak memory consumption was 601.2 MB. Max. memory is 11.5 GB. [2018-12-02 14:21:50,402 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:21:50,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2018-12-02 14:21:50,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:21:50,402 INFO L168 Benchmark]: Boogie Preprocessor took 34.69 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 14:21:50,403 INFO L168 Benchmark]: RCFGBuilder took 593.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 968.7 MB in the end (delta: 108.8 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:21:50,403 INFO L168 Benchmark]: TraceAbstraction took 8288.29 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 301.5 MB). Free memory was 968.7 MB in the beginning and 753.7 MB in the end (delta: 215.1 MB). Peak memory consumption was 516.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:21:50,403 INFO L168 Benchmark]: Witness Printer took 90.79 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 144.2 MB). Free memory was 753.7 MB in the beginning and 1.5 GB in the end (delta: -775.2 MB). Peak memory consumption was 5.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:21:50,404 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.69 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 593.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 968.7 MB in the end (delta: 108.8 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8288.29 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 301.5 MB). Free memory was 968.7 MB in the beginning and 753.7 MB in the end (delta: 215.1 MB). Peak memory consumption was 516.5 MB. Max. memory is 11.5 GB. * Witness Printer took 90.79 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 144.2 MB). Free memory was 753.7 MB in the beginning and 1.5 GB in the end (delta: -775.2 MB). Peak memory consumption was 5.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 436]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; VAL [\old(a)=24, \old(a11)=27, \old(a17)=14, \old(a19)=15, \old(a21)=18, \old(a25)=20, \old(a28)=28, \old(c)=16, \old(d)=22, \old(e)=13, \old(f)=21, \old(u)=25, \old(v)=12, \old(w)=23, \old(x)=17, \old(y)=26, \old(z)=19, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L603] int output = -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] return 26; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=1, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=1, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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 !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND TRUE (!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))) [L350] a28 = 9 [L351] a11 = 1 [L352] a25 = 0 [L353] return -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=11, \old(input)=4, \result=-1, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L614] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL calculate_output(input) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L435] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L436] __VERIFIER_error() VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. UNSAFE Result, 8.2s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 882 SDtfs, 3804 SDslu, 358 SDs, 0 SdLazy, 3729 SolverSat, 968 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 648 GetRequests, 589 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1655occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.9974000476630008 AbsIntWeakeningRatio, 0.23509933774834438 AbsIntAvgWeakeningVarsNumRemoved, 26.9635761589404 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 520 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1064 NumberOfCodeBlocks, 1064 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1020 ConstructedInterpolants, 0 QuantifiedInterpolants, 342184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 435 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 297/321 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...