./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 58e857a51148141aa14a27a9d40d99edfe00074b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-a4ecdab [2020-11-30 02:23:20,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:23:20,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:23:21,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:23:21,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:23:21,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:23:21,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:23:21,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:23:21,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:23:21,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:23:21,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:23:21,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:23:21,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:23:21,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:23:21,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:23:21,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:23:21,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:23:21,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:23:21,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:23:21,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:23:21,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:23:21,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:23:21,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:23:21,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:23:21,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:23:21,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:23:21,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:23:21,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:23:21,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:23:21,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:23:21,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:23:21,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:23:21,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:23:21,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:23:21,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:23:21,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:23:21,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:23:21,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:23:21,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:23:21,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:23:21,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:23:21,130 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 02:23:21,186 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:23:21,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:23:21,191 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:23:21,192 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:23:21,192 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:23:21,193 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:23:21,193 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 02:23:21,193 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:23:21,194 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:23:21,194 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 02:23:21,195 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 02:23:21,196 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:23:21,196 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 02:23:21,197 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 02:23:21,197 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 02:23:21,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:23:21,198 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:23:21,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:23:21,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:23:21,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:23:21,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 02:23:21,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:23:21,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 02:23:21,200 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:23:21,200 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:23:21,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 02:23:21,201 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:23:21,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 02:23:21,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:23:21,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:23:21,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:23:21,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:23:21,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:23:21,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:23:21,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 02:23:21,207 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 02:23:21,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 02:23:21,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 02:23:21,208 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:23:21,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:23:21,208 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/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(reach_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 -> 58e857a51148141aa14a27a9d40d99edfe00074b [2020-11-30 02:23:21,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:23:21,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:23:21,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:23:21,544 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:23:21,545 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:23:21,546 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2020-11-30 02:23:21,637 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/data/b206fa7c1/641316de2b5147709530915b06d4a6ce/FLAGc6487dbc1 [2020-11-30 02:23:22,386 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:23:22,387 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2020-11-30 02:23:22,408 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/data/b206fa7c1/641316de2b5147709530915b06d4a6ce/FLAGc6487dbc1 [2020-11-30 02:23:22,559 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/data/b206fa7c1/641316de2b5147709530915b06d4a6ce [2020-11-30 02:23:22,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:23:22,563 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:23:22,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:23:22,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:23:22,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:23:22,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:23:22" (1/1) ... [2020-11-30 02:23:22,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e513e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:22, skipping insertion in model container [2020-11-30 02:23:22,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:23:22" (1/1) ... [2020-11-30 02:23:22,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:23:22,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:23:23,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:23:23,194 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:23:23,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:23:23,392 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:23:23,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:23 WrapperNode [2020-11-30 02:23:23,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:23:23,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:23:23,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:23:23,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:23:23,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:23" (1/1) ... [2020-11-30 02:23:23,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:23" (1/1) ... [2020-11-30 02:23:23,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:23:23,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:23:23,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:23:23,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:23:23,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:23" (1/1) ... [2020-11-30 02:23:23,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:23" (1/1) ... [2020-11-30 02:23:23,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:23" (1/1) ... [2020-11-30 02:23:23,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:23" (1/1) ... [2020-11-30 02:23:23,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:23" (1/1) ... [2020-11-30 02:23:23,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:23" (1/1) ... [2020-11-30 02:23:23,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:23" (1/1) ... [2020-11-30 02:23:23,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:23:23,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:23:23,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:23:23,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:23:23,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/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 [2020-11-30 02:23:23,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 02:23:23,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:23:23,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:23:23,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:23:27,143 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:23:27,144 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-30 02:23:27,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:23:27 BoogieIcfgContainer [2020-11-30 02:23:27,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:23:27,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:23:27,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:23:27,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:23:27,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:23:22" (1/3) ... [2020-11-30 02:23:27,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cb4e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:23:27, skipping insertion in model container [2020-11-30 02:23:27,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:23" (2/3) ... [2020-11-30 02:23:27,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cb4e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:23:27, skipping insertion in model container [2020-11-30 02:23:27,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:23:27" (3/3) ... [2020-11-30 02:23:27,166 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label59.c [2020-11-30 02:23:27,186 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:23:27,192 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 02:23:27,208 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 02:23:27,255 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:23:27,255 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 02:23:27,256 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:23:27,256 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:23:27,256 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:23:27,257 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:23:27,257 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:23:27,257 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:23:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2020-11-30 02:23:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-30 02:23:27,296 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:27,297 INFO L422 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] [2020-11-30 02:23:27,298 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:27,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:27,306 INFO L82 PathProgramCache]: Analyzing trace with hash -216674609, now seen corresponding path program 1 times [2020-11-30 02:23:27,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:27,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598887361] [2020-11-30 02:23:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:27,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598887361] [2020-11-30 02:23:27,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:27,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:23:27,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603977505] [2020-11-30 02:23:27,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:27,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:27,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:27,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:27,870 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 3 states. [2020-11-30 02:23:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:28,717 INFO L93 Difference]: Finished difference Result 251 states and 482 transitions. [2020-11-30 02:23:28,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:28,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-11-30 02:23:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:28,744 INFO L225 Difference]: With dead ends: 251 [2020-11-30 02:23:28,756 INFO L226 Difference]: Without dead ends: 163 [2020-11-30 02:23:28,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-11-30 02:23:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2020-11-30 02:23:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-11-30 02:23:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 293 transitions. [2020-11-30 02:23:28,845 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 293 transitions. Word has length 80 [2020-11-30 02:23:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:28,848 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 293 transitions. [2020-11-30 02:23:28,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 293 transitions. [2020-11-30 02:23:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-30 02:23:28,858 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:28,859 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:23:28,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 02:23:28,859 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:28,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:28,862 INFO L82 PathProgramCache]: Analyzing trace with hash 710634124, now seen corresponding path program 1 times [2020-11-30 02:23:28,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:28,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316303751] [2020-11-30 02:23:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:28,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316303751] [2020-11-30 02:23:28,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:28,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:23:28,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793745131] [2020-11-30 02:23:28,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:28,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:28,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:28,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:28,978 INFO L87 Difference]: Start difference. First operand 163 states and 293 transitions. Second operand 3 states. [2020-11-30 02:23:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:29,631 INFO L93 Difference]: Finished difference Result 485 states and 876 transitions. [2020-11-30 02:23:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:29,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-11-30 02:23:29,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:29,636 INFO L225 Difference]: With dead ends: 485 [2020-11-30 02:23:29,636 INFO L226 Difference]: Without dead ends: 323 [2020-11-30 02:23:29,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-11-30 02:23:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2020-11-30 02:23:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-11-30 02:23:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 484 transitions. [2020-11-30 02:23:29,671 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 484 transitions. Word has length 88 [2020-11-30 02:23:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:29,672 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 484 transitions. [2020-11-30 02:23:29,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 484 transitions. [2020-11-30 02:23:29,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-30 02:23:29,677 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:29,678 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:23:29,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 02:23:29,678 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:29,679 INFO L82 PathProgramCache]: Analyzing trace with hash 96898292, now seen corresponding path program 1 times [2020-11-30 02:23:29,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:29,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024792187] [2020-11-30 02:23:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:29,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024792187] [2020-11-30 02:23:29,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:29,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:29,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976700700] [2020-11-30 02:23:29,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:29,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:29,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:29,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:29,887 INFO L87 Difference]: Start difference. First operand 323 states and 484 transitions. Second operand 3 states. [2020-11-30 02:23:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:30,417 INFO L93 Difference]: Finished difference Result 805 states and 1258 transitions. [2020-11-30 02:23:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:30,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-11-30 02:23:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:30,424 INFO L225 Difference]: With dead ends: 805 [2020-11-30 02:23:30,424 INFO L226 Difference]: Without dead ends: 483 [2020-11-30 02:23:30,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2020-11-30 02:23:30,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2020-11-30 02:23:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2020-11-30 02:23:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 669 transitions. [2020-11-30 02:23:30,457 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 669 transitions. Word has length 89 [2020-11-30 02:23:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:30,457 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 669 transitions. [2020-11-30 02:23:30,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 669 transitions. [2020-11-30 02:23:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-30 02:23:30,461 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:30,462 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:23:30,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 02:23:30,462 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:30,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:30,463 INFO L82 PathProgramCache]: Analyzing trace with hash -98671215, now seen corresponding path program 1 times [2020-11-30 02:23:30,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:30,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27831327] [2020-11-30 02:23:30,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:30,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27831327] [2020-11-30 02:23:30,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:30,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:23:30,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480654811] [2020-11-30 02:23:30,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:30,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:30,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:30,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:30,523 INFO L87 Difference]: Start difference. First operand 483 states and 669 transitions. Second operand 3 states. [2020-11-30 02:23:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:30,982 INFO L93 Difference]: Finished difference Result 1365 states and 1909 transitions. [2020-11-30 02:23:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:30,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-11-30 02:23:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:30,988 INFO L225 Difference]: With dead ends: 1365 [2020-11-30 02:23:30,988 INFO L226 Difference]: Without dead ends: 883 [2020-11-30 02:23:30,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2020-11-30 02:23:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2020-11-30 02:23:31,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2020-11-30 02:23:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1176 transitions. [2020-11-30 02:23:31,022 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1176 transitions. Word has length 90 [2020-11-30 02:23:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:31,023 INFO L481 AbstractCegarLoop]: Abstraction has 883 states and 1176 transitions. [2020-11-30 02:23:31,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1176 transitions. [2020-11-30 02:23:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-30 02:23:31,026 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:31,027 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:23:31,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 02:23:31,027 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:31,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:31,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1261870695, now seen corresponding path program 1 times [2020-11-30 02:23:31,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:31,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123649947] [2020-11-30 02:23:31,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:31,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123649947] [2020-11-30 02:23:31,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375959749] [2020-11-30 02:23:31,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:23:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:31,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 02:23:31,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:23:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 02:23:31,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:23:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 02:23:31,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 02:23:31,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2020-11-30 02:23:31,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75325739] [2020-11-30 02:23:31,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:31,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:31,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:31,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:23:31,521 INFO L87 Difference]: Start difference. First operand 883 states and 1176 transitions. Second operand 3 states. [2020-11-30 02:23:32,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:32,119 INFO L93 Difference]: Finished difference Result 2485 states and 3344 transitions. [2020-11-30 02:23:32,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:32,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-11-30 02:23:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:32,132 INFO L225 Difference]: With dead ends: 2485 [2020-11-30 02:23:32,132 INFO L226 Difference]: Without dead ends: 1603 [2020-11-30 02:23:32,135 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:23:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2020-11-30 02:23:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1523. [2020-11-30 02:23:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2020-11-30 02:23:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 2051 transitions. [2020-11-30 02:23:32,199 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 2051 transitions. Word has length 93 [2020-11-30 02:23:32,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:32,200 INFO L481 AbstractCegarLoop]: Abstraction has 1523 states and 2051 transitions. [2020-11-30 02:23:32,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2051 transitions. [2020-11-30 02:23:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-11-30 02:23:32,205 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:32,205 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:23:32,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:23:32,422 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:32,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:32,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1061616074, now seen corresponding path program 1 times [2020-11-30 02:23:32,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:32,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762310719] [2020-11-30 02:23:32,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:32,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762310719] [2020-11-30 02:23:32,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:32,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:32,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929440714] [2020-11-30 02:23:32,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:32,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:32,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:32,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:32,574 INFO L87 Difference]: Start difference. First operand 1523 states and 2051 transitions. Second operand 3 states. [2020-11-30 02:23:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:33,212 INFO L93 Difference]: Finished difference Result 3445 states and 4763 transitions. [2020-11-30 02:23:33,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:33,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2020-11-30 02:23:33,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:33,228 INFO L225 Difference]: With dead ends: 3445 [2020-11-30 02:23:33,228 INFO L226 Difference]: Without dead ends: 1923 [2020-11-30 02:23:33,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2020-11-30 02:23:33,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1683. [2020-11-30 02:23:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2020-11-30 02:23:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2261 transitions. [2020-11-30 02:23:33,295 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2261 transitions. Word has length 110 [2020-11-30 02:23:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:33,296 INFO L481 AbstractCegarLoop]: Abstraction has 1683 states and 2261 transitions. [2020-11-30 02:23:33,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2261 transitions. [2020-11-30 02:23:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-30 02:23:33,301 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:33,302 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2020-11-30 02:23:33,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 02:23:33,304 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash -562755127, now seen corresponding path program 1 times [2020-11-30 02:23:33,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:33,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972140619] [2020-11-30 02:23:33,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-30 02:23:33,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972140619] [2020-11-30 02:23:33,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344945281] [2020-11-30 02:23:33,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:23:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:33,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 02:23:33,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:23:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 02:23:33,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:23:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-30 02:23:33,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 02:23:33,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 5 [2020-11-30 02:23:33,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548432672] [2020-11-30 02:23:33,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:33,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:33,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:33,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:23:33,681 INFO L87 Difference]: Start difference. First operand 1683 states and 2261 transitions. Second operand 3 states. [2020-11-30 02:23:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:34,333 INFO L93 Difference]: Finished difference Result 3845 states and 5222 transitions. [2020-11-30 02:23:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:34,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-11-30 02:23:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:34,348 INFO L225 Difference]: With dead ends: 3845 [2020-11-30 02:23:34,349 INFO L226 Difference]: Without dead ends: 2163 [2020-11-30 02:23:34,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:23:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2020-11-30 02:23:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 1603. [2020-11-30 02:23:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2020-11-30 02:23:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2141 transitions. [2020-11-30 02:23:34,410 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2141 transitions. Word has length 113 [2020-11-30 02:23:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:34,411 INFO L481 AbstractCegarLoop]: Abstraction has 1603 states and 2141 transitions. [2020-11-30 02:23:34,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2141 transitions. [2020-11-30 02:23:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-30 02:23:34,416 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:34,416 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-11-30 02:23:34,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:23:34,642 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:34,643 INFO L82 PathProgramCache]: Analyzing trace with hash -333113449, now seen corresponding path program 1 times [2020-11-30 02:23:34,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:34,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788168921] [2020-11-30 02:23:34,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:34,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788168921] [2020-11-30 02:23:34,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:34,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:23:34,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344779301] [2020-11-30 02:23:34,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:34,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:34,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:34,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:34,746 INFO L87 Difference]: Start difference. First operand 1603 states and 2141 transitions. Second operand 3 states. [2020-11-30 02:23:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:35,388 INFO L93 Difference]: Finished difference Result 4327 states and 5744 transitions. [2020-11-30 02:23:35,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:35,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-11-30 02:23:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:35,407 INFO L225 Difference]: With dead ends: 4327 [2020-11-30 02:23:35,408 INFO L226 Difference]: Without dead ends: 2725 [2020-11-30 02:23:35,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2020-11-30 02:23:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2723. [2020-11-30 02:23:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2020-11-30 02:23:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3513 transitions. [2020-11-30 02:23:35,533 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3513 transitions. Word has length 113 [2020-11-30 02:23:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:35,534 INFO L481 AbstractCegarLoop]: Abstraction has 2723 states and 3513 transitions. [2020-11-30 02:23:35,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3513 transitions. [2020-11-30 02:23:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-11-30 02:23:35,541 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:35,541 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:23:35,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 02:23:35,542 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2064345873, now seen corresponding path program 1 times [2020-11-30 02:23:35,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:35,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540495250] [2020-11-30 02:23:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-11-30 02:23:35,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540495250] [2020-11-30 02:23:35,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176837281] [2020-11-30 02:23:35,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:23:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:35,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 02:23:35,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:23:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-11-30 02:23:35,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:23:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-11-30 02:23:35,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 02:23:35,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2020-11-30 02:23:35,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914652955] [2020-11-30 02:23:35,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:35,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:35,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:35,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:23:35,856 INFO L87 Difference]: Start difference. First operand 2723 states and 3513 transitions. Second operand 3 states. [2020-11-30 02:23:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:36,196 INFO L93 Difference]: Finished difference Result 4805 states and 6094 transitions. [2020-11-30 02:23:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:36,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2020-11-30 02:23:36,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:36,210 INFO L225 Difference]: With dead ends: 4805 [2020-11-30 02:23:36,211 INFO L226 Difference]: Without dead ends: 2083 [2020-11-30 02:23:36,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:23:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2020-11-30 02:23:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1203. [2020-11-30 02:23:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2020-11-30 02:23:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1470 transitions. [2020-11-30 02:23:36,261 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1470 transitions. Word has length 128 [2020-11-30 02:23:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:36,261 INFO L481 AbstractCegarLoop]: Abstraction has 1203 states and 1470 transitions. [2020-11-30 02:23:36,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1470 transitions. [2020-11-30 02:23:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-30 02:23:36,265 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:36,266 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-11-30 02:23:36,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:23:36,482 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:36,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:36,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1639445929, now seen corresponding path program 1 times [2020-11-30 02:23:36,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:36,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219094957] [2020-11-30 02:23:36,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:36,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219094957] [2020-11-30 02:23:36,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:36,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:36,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315147861] [2020-11-30 02:23:36,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:36,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:36,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:36,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:36,586 INFO L87 Difference]: Start difference. First operand 1203 states and 1470 transitions. Second operand 3 states. [2020-11-30 02:23:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:37,040 INFO L93 Difference]: Finished difference Result 2405 states and 2939 transitions. [2020-11-30 02:23:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:37,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-11-30 02:23:37,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:37,048 INFO L225 Difference]: With dead ends: 2405 [2020-11-30 02:23:37,049 INFO L226 Difference]: Without dead ends: 1203 [2020-11-30 02:23:37,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-11-30 02:23:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2020-11-30 02:23:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2020-11-30 02:23:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1459 transitions. [2020-11-30 02:23:37,087 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1459 transitions. Word has length 133 [2020-11-30 02:23:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:37,087 INFO L481 AbstractCegarLoop]: Abstraction has 1203 states and 1459 transitions. [2020-11-30 02:23:37,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1459 transitions. [2020-11-30 02:23:37,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-30 02:23:37,091 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:37,091 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:23:37,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 02:23:37,092 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1682334220, now seen corresponding path program 1 times [2020-11-30 02:23:37,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:37,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397036496] [2020-11-30 02:23:37,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-11-30 02:23:37,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397036496] [2020-11-30 02:23:37,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:37,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:37,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423007431] [2020-11-30 02:23:37,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:37,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:37,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:37,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:37,171 INFO L87 Difference]: Start difference. First operand 1203 states and 1459 transitions. Second operand 3 states. [2020-11-30 02:23:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:37,675 INFO L93 Difference]: Finished difference Result 2325 states and 2832 transitions. [2020-11-30 02:23:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:37,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2020-11-30 02:23:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:37,683 INFO L225 Difference]: With dead ends: 2325 [2020-11-30 02:23:37,683 INFO L226 Difference]: Without dead ends: 1123 [2020-11-30 02:23:37,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2020-11-30 02:23:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1043. [2020-11-30 02:23:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2020-11-30 02:23:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1244 transitions. [2020-11-30 02:23:37,713 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1244 transitions. Word has length 137 [2020-11-30 02:23:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:37,713 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1244 transitions. [2020-11-30 02:23:37,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1244 transitions. [2020-11-30 02:23:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-11-30 02:23:37,717 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:37,718 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:23:37,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 02:23:37,718 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1517375402, now seen corresponding path program 1 times [2020-11-30 02:23:37,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:37,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225116535] [2020-11-30 02:23:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-11-30 02:23:37,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225116535] [2020-11-30 02:23:37,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:37,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:37,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127639643] [2020-11-30 02:23:37,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:37,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:37,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:37,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:37,789 INFO L87 Difference]: Start difference. First operand 1043 states and 1244 transitions. Second operand 3 states. [2020-11-30 02:23:38,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:38,291 INFO L93 Difference]: Finished difference Result 2405 states and 2872 transitions. [2020-11-30 02:23:38,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:38,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2020-11-30 02:23:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:38,299 INFO L225 Difference]: With dead ends: 2405 [2020-11-30 02:23:38,299 INFO L226 Difference]: Without dead ends: 1283 [2020-11-30 02:23:38,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2020-11-30 02:23:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2020-11-30 02:23:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2020-11-30 02:23:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1480 transitions. [2020-11-30 02:23:38,332 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1480 transitions. Word has length 141 [2020-11-30 02:23:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:38,333 INFO L481 AbstractCegarLoop]: Abstraction has 1283 states and 1480 transitions. [2020-11-30 02:23:38,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1480 transitions. [2020-11-30 02:23:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-11-30 02:23:38,336 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:38,337 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:23:38,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 02:23:38,337 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:38,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:38,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1105722830, now seen corresponding path program 1 times [2020-11-30 02:23:38,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:38,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238491366] [2020-11-30 02:23:38,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-30 02:23:38,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238491366] [2020-11-30 02:23:38,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:38,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:38,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705968406] [2020-11-30 02:23:38,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:38,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:38,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:38,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:38,440 INFO L87 Difference]: Start difference. First operand 1283 states and 1480 transitions. Second operand 3 states. [2020-11-30 02:23:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:38,933 INFO L93 Difference]: Finished difference Result 2645 states and 3062 transitions. [2020-11-30 02:23:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:38,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2020-11-30 02:23:38,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:38,940 INFO L225 Difference]: With dead ends: 2645 [2020-11-30 02:23:38,940 INFO L226 Difference]: Without dead ends: 1123 [2020-11-30 02:23:38,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2020-11-30 02:23:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2020-11-30 02:23:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2020-11-30 02:23:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1279 transitions. [2020-11-30 02:23:38,974 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1279 transitions. Word has length 148 [2020-11-30 02:23:38,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:38,975 INFO L481 AbstractCegarLoop]: Abstraction has 1123 states and 1279 transitions. [2020-11-30 02:23:38,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:38,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1279 transitions. [2020-11-30 02:23:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-11-30 02:23:38,979 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:38,980 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-11-30 02:23:38,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 02:23:38,980 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:38,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1733280306, now seen corresponding path program 1 times [2020-11-30 02:23:38,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:38,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27450467] [2020-11-30 02:23:38,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-11-30 02:23:39,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27450467] [2020-11-30 02:23:39,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:39,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:23:39,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561295373] [2020-11-30 02:23:39,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:23:39,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:39,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:23:39,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:23:39,215 INFO L87 Difference]: Start difference. First operand 1123 states and 1279 transitions. Second operand 5 states. [2020-11-30 02:23:40,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:40,250 INFO L93 Difference]: Finished difference Result 2364 states and 2694 transitions. [2020-11-30 02:23:40,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:23:40,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2020-11-30 02:23:40,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:40,257 INFO L225 Difference]: With dead ends: 2364 [2020-11-30 02:23:40,258 INFO L226 Difference]: Without dead ends: 1076 [2020-11-30 02:23:40,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:23:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2020-11-30 02:23:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1043. [2020-11-30 02:23:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2020-11-30 02:23:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1124 transitions. [2020-11-30 02:23:40,293 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1124 transitions. Word has length 186 [2020-11-30 02:23:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:40,294 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1124 transitions. [2020-11-30 02:23:40,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:23:40,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1124 transitions. [2020-11-30 02:23:40,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-11-30 02:23:40,299 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:40,299 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2020-11-30 02:23:40,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 02:23:40,300 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:40,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:40,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1457112038, now seen corresponding path program 1 times [2020-11-30 02:23:40,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:40,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440104061] [2020-11-30 02:23:40,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-11-30 02:23:40,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440104061] [2020-11-30 02:23:40,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:40,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:23:40,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318165344] [2020-11-30 02:23:40,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:23:40,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:40,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:23:40,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:23:40,443 INFO L87 Difference]: Start difference. First operand 1043 states and 1124 transitions. Second operand 4 states. [2020-11-30 02:23:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:41,033 INFO L93 Difference]: Finished difference Result 2005 states and 2164 transitions. [2020-11-30 02:23:41,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:23:41,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2020-11-30 02:23:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:41,040 INFO L225 Difference]: With dead ends: 2005 [2020-11-30 02:23:41,040 INFO L226 Difference]: Without dead ends: 1043 [2020-11-30 02:23:41,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:23:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2020-11-30 02:23:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2020-11-30 02:23:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2020-11-30 02:23:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1121 transitions. [2020-11-30 02:23:41,073 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1121 transitions. Word has length 206 [2020-11-30 02:23:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:41,074 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1121 transitions. [2020-11-30 02:23:41,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:23:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1121 transitions. [2020-11-30 02:23:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-11-30 02:23:41,079 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:41,079 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-30 02:23:41,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 02:23:41,080 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:41,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:41,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1074822509, now seen corresponding path program 1 times [2020-11-30 02:23:41,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:41,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048252273] [2020-11-30 02:23:41,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:41,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048252273] [2020-11-30 02:23:41,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:41,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:23:41,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481421408] [2020-11-30 02:23:41,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:23:41,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:41,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:23:41,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:23:41,306 INFO L87 Difference]: Start difference. First operand 1043 states and 1121 transitions. Second operand 4 states. [2020-11-30 02:23:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:41,888 INFO L93 Difference]: Finished difference Result 2005 states and 2158 transitions. [2020-11-30 02:23:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:23:41,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2020-11-30 02:23:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:41,894 INFO L225 Difference]: With dead ends: 2005 [2020-11-30 02:23:41,894 INFO L226 Difference]: Without dead ends: 1043 [2020-11-30 02:23:41,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:23:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2020-11-30 02:23:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2020-11-30 02:23:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2020-11-30 02:23:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1118 transitions. [2020-11-30 02:23:41,925 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1118 transitions. Word has length 213 [2020-11-30 02:23:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:41,926 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1118 transitions. [2020-11-30 02:23:41,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:23:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1118 transitions. [2020-11-30 02:23:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-11-30 02:23:41,931 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:41,931 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:23:41,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 02:23:41,932 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:41,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:41,932 INFO L82 PathProgramCache]: Analyzing trace with hash 934922050, now seen corresponding path program 1 times [2020-11-30 02:23:41,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:41,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381631796] [2020-11-30 02:23:41,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:23:42,030 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:23:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:23:42,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:23:42,198 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-30 02:23:42,198 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 02:23:42,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 02:23:42,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:23:42 BoogieIcfgContainer [2020-11-30 02:23:42,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 02:23:42,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 02:23:42,470 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 02:23:42,470 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 02:23:42,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:23:27" (3/4) ... [2020-11-30 02:23:42,473 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 02:23:42,737 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7d5092f6-48ac-4944-a5f0-bce48d23b288/bin/utaipan/witness.graphml [2020-11-30 02:23:42,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 02:23:42,739 INFO L168 Benchmark]: Toolchain (without parser) took 20175.03 ms. Allocated memory was 113.2 MB in the beginning and 354.4 MB in the end (delta: 241.2 MB). Free memory was 84.4 MB in the beginning and 234.2 MB in the end (delta: -149.8 MB). Peak memory consumption was 92.4 MB. Max. memory is 16.1 GB. [2020-11-30 02:23:42,740 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 113.2 MB. Free memory was 70.7 MB in the beginning and 70.6 MB in the end (delta: 65.7 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:23:42,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.66 ms. Allocated memory is still 113.2 MB. Free memory was 84.2 MB in the beginning and 73.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 02:23:42,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.65 ms. Allocated memory is still 113.2 MB. Free memory was 73.6 MB in the beginning and 68.0 MB in the end (delta: 5.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 02:23:42,742 INFO L168 Benchmark]: Boogie Preprocessor took 78.07 ms. Allocated memory is still 113.2 MB. Free memory was 68.0 MB in the beginning and 63.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 02:23:42,742 INFO L168 Benchmark]: RCFGBuilder took 3558.69 ms. Allocated memory was 113.2 MB in the beginning and 186.6 MB in the end (delta: 73.4 MB). Free memory was 63.6 MB in the beginning and 133.9 MB in the end (delta: -70.3 MB). Peak memory consumption was 57.5 MB. Max. memory is 16.1 GB. [2020-11-30 02:23:42,743 INFO L168 Benchmark]: TraceAbstraction took 15316.12 ms. Allocated memory was 186.6 MB in the beginning and 354.4 MB in the end (delta: 167.8 MB). Free memory was 132.9 MB in the beginning and 268.8 MB in the end (delta: -135.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 16.1 GB. [2020-11-30 02:23:42,743 INFO L168 Benchmark]: Witness Printer took 268.29 ms. Allocated memory is still 354.4 MB. Free memory was 267.7 MB in the beginning and 234.2 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2020-11-30 02:23:42,745 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 113.2 MB. Free memory was 70.7 MB in the beginning and 70.6 MB in the end (delta: 65.7 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 826.66 ms. Allocated memory is still 113.2 MB. Free memory was 84.2 MB in the beginning and 73.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 114.65 ms. Allocated memory is still 113.2 MB. Free memory was 73.6 MB in the beginning and 68.0 MB in the end (delta: 5.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 78.07 ms. Allocated memory is still 113.2 MB. Free memory was 68.0 MB in the beginning and 63.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3558.69 ms. Allocated memory was 113.2 MB in the beginning and 186.6 MB in the end (delta: 73.4 MB). Free memory was 63.6 MB in the beginning and 133.9 MB in the end (delta: -70.3 MB). Peak memory consumption was 57.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15316.12 ms. Allocated memory was 186.6 MB in the beginning and 354.4 MB in the end (delta: 167.8 MB). Free memory was 132.9 MB in the beginning and 268.8 MB in the end (delta: -135.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 16.1 GB. * Witness Printer took 268.29 ms. Allocated memory is still 354.4 MB. Free memory was 267.7 MB in the beginning and 234.2 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; [L613] int output = -1; VAL [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] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [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] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [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] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [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] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [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] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [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] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [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] [L64] 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 [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] [L69] 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 [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] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [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] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [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] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [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] [L92] 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 [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] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [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] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [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] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [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] [L116] 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 [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] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [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] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [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] [L133] 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 [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] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [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] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [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] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [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] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [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] [L158] 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 [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] [L164] 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 [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] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [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] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [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] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [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] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [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] [L189] 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 [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] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [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] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [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] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [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] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [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] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [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] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [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] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [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] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [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] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [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] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [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] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [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] [L235] 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 [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] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [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] [L244] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L245] a28 = 9 [L246] return 23; VAL [a=1, a11=0, 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] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, 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] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, 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] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, 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] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, 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] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, 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] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, 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] [L64] 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 [a=1, a11=0, 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] [L69] 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 [a=1, a11=0, 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] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, 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] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, 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] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, 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] [L92] 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 [a=1, a11=0, 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] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, 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] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, 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] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, 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] [L116] 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 [a=1, a11=0, 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] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, 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] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, 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] [L133] 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 [a=1, a11=0, 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] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, 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] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, 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] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, 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] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, 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] [L158] 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 [a=1, a11=0, 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] [L164] 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 [a=1, a11=0, 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] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, 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] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, 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] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, 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] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, 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] [L189] 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 [a=1, a11=0, 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] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, 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] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, 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] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, 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] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, 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] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, 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] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, 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] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, 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] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, 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] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, 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] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, 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] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, 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] [L235] 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 [a=1, a11=0, 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] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, 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] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, 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] [L247] 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 [a=1, a11=0, 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] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, 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] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, 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] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, 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] [L271] 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 [a=1, a11=0, 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] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, 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] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, 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] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, 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] [L296] 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 [a=1, a11=0, 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] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, 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] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, 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] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, 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] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, 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] [L324] 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 [a=1, a11=0, 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] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, 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] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, 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] [L347] 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 [a=1, a11=0, 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] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, 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] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, 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] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, 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] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, 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] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, 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] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, 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] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, 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] [L399] 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 [a=1, a11=0, 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] [L404] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L405] a19 = 0 [L406] a28 = 7 [L407] return 25; VAL [a=1, a11=0, a17=8, a19=0, 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] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L64] 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 [a=1, a11=0, a17=8, a19=0, 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] [L69] 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 [a=1, a11=0, a17=8, a19=0, 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] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L92] 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 [a=1, a11=0, a17=8, a19=0, 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] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L116] 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 [a=1, a11=0, a17=8, a19=0, 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] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L133] 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 [a=1, a11=0, a17=8, a19=0, 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] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, 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] [L158] 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 [a=1, a11=0, a17=8, a19=0, 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] [L164] COND TRUE ((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))) [L165] a25 = 1 [L166] a19 = 1 [L167] a28 = 7 [L168] return -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L235] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L247] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L399] 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 [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L430] COND TRUE ((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L12] __assert_fail("0", "Problem02_label59.c", 4, "reach_error") VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.9s, OverallIterations: 17, TraceHistogramMax: 5, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1252 SDtfs, 1125 SDslu, 116 SDs, 0 SdLazy, 4078 SolverSat, 817 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 712 GetRequests, 681 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2723occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 1875 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2630 NumberOfCodeBlocks, 2630 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2714 ConstructedInterpolants, 0 QuantifiedInterpolants, 857737 SizeOfPredicates, 3 NumberOfNonLiveVariables, 828 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 1471/1485 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...