/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/eca-rers2012/Problem01_label38.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:46:37,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:46:37,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:46:38,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:46:38,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:46:38,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:46:38,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:46:38,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:46:38,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:46:38,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:46:38,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:46:38,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:46:38,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:46:38,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:46:38,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:46:38,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:46:38,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:46:38,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:46:38,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:46:38,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:46:38,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:46:38,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:46:38,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:46:38,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:46:38,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:46:38,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:46:38,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:46:38,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:46:38,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:46:38,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:46:38,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:46:38,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:46:38,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:46:38,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:46:38,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:46:38,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:46:38,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:46:38,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:46:38,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:46:38,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:46:38,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:46:38,127 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:46:38,153 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:46:38,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:46:38,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:46:38,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:46:38,155 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:46:38,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:46:38,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:46:38,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:46:38,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:46:38,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:46:38,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:46:38,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:46:38,157 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:46:38,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:46:38,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:46:38,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:46:38,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:46:38,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:46:38,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:46:38,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:46:38,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:46:38,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:46:38,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:46:38,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:46:38,159 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:46:38,160 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/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 [2021-01-06 11:46:38,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:46:38,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:46:38,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:46:38,565 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:46:38,566 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:46:38,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2021-01-06 11:46:38,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cbbc24a95/62acd11ef74b493ab94c3fa597f225e8/FLAG140acb42a [2021-01-06 11:46:39,412 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:46:39,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2021-01-06 11:46:39,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cbbc24a95/62acd11ef74b493ab94c3fa597f225e8/FLAG140acb42a [2021-01-06 11:46:39,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cbbc24a95/62acd11ef74b493ab94c3fa597f225e8 [2021-01-06 11:46:39,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:46:39,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:46:39,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:46:39,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:46:39,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:46:39,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:46:39" (1/1) ... [2021-01-06 11:46:39,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d0bdc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:39, skipping insertion in model container [2021-01-06 11:46:39,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:46:39" (1/1) ... [2021-01-06 11:46:39,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:46:39,741 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] [2021-01-06 11:46:40,230 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 11:46:40,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:46:40,295 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] [2021-01-06 11:46:40,383 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 11:46:40,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:46:40,456 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:46:40,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:40 WrapperNode [2021-01-06 11:46:40,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:46:40,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:46:40,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:46:40,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:46:40,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:40" (1/1) ... [2021-01-06 11:46:40,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:40" (1/1) ... [2021-01-06 11:46:40,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:46:40,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:46:40,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:46:40,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:46:40,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:40" (1/1) ... [2021-01-06 11:46:40,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:40" (1/1) ... [2021-01-06 11:46:40,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:40" (1/1) ... [2021-01-06 11:46:40,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:40" (1/1) ... [2021-01-06 11:46:40,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:40" (1/1) ... [2021-01-06 11:46:40,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:40" (1/1) ... [2021-01-06 11:46:40,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:40" (1/1) ... [2021-01-06 11:46:40,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:46:40,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:46:40,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:46:40,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:46:40,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:40" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/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 [2021-01-06 11:46:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:46:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:46:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:46:40,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:46:42,170 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:46:42,171 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:46:42,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:46:42 BoogieIcfgContainer [2021-01-06 11:46:42,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:46:42,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:46:42,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:46:42,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:46:42,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:46:39" (1/3) ... [2021-01-06 11:46:42,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a365e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:46:42, skipping insertion in model container [2021-01-06 11:46:42,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:40" (2/3) ... [2021-01-06 11:46:42,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a365e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:46:42, skipping insertion in model container [2021-01-06 11:46:42,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:46:42" (3/3) ... [2021-01-06 11:46:42,184 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label38.c [2021-01-06 11:46:42,191 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:46:42,197 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:46:42,218 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:46:42,248 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:46:42,249 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:46:42,249 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:46:42,249 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:46:42,249 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:46:42,249 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:46:42,250 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:46:42,250 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:46:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2021-01-06 11:46:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 11:46:42,281 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:42,282 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, 1, 1] [2021-01-06 11:46:42,283 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:42,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:42,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1553748631, now seen corresponding path program 1 times [2021-01-06 11:46:42,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:42,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593112408] [2021-01-06 11:46:42,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:46:42,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593112408] [2021-01-06 11:46:42,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:42,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:46:42,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511379515] [2021-01-06 11:46:42,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:42,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:42,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:42,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:42,748 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2021-01-06 11:46:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:43,530 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2021-01-06 11:46:43,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:43,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2021-01-06 11:46:43,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:43,549 INFO L225 Difference]: With dead ends: 528 [2021-01-06 11:46:43,549 INFO L226 Difference]: Without dead ends: 266 [2021-01-06 11:46:43,554 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 [2021-01-06 11:46:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-01-06 11:46:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-01-06 11:46:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2021-01-06 11:46:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2021-01-06 11:46:43,617 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 82 [2021-01-06 11:46:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:43,618 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2021-01-06 11:46:43,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2021-01-06 11:46:43,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:46:43,623 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:43,623 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:43,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:46:43,623 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:43,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:43,624 INFO L82 PathProgramCache]: Analyzing trace with hash 952619370, now seen corresponding path program 1 times [2021-01-06 11:46:43,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:43,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333526066] [2021-01-06 11:46:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:46:43,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333526066] [2021-01-06 11:46:43,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:43,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:46:43,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711299254] [2021-01-06 11:46:43,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:43,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:43,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:43,747 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 3 states. [2021-01-06 11:46:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:44,297 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2021-01-06 11:46:44,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:44,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2021-01-06 11:46:44,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:44,303 INFO L225 Difference]: With dead ends: 792 [2021-01-06 11:46:44,303 INFO L226 Difference]: Without dead ends: 528 [2021-01-06 11:46:44,305 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 [2021-01-06 11:46:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-01-06 11:46:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2021-01-06 11:46:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2021-01-06 11:46:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 709 transitions. [2021-01-06 11:46:44,340 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 709 transitions. Word has length 88 [2021-01-06 11:46:44,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:44,340 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 709 transitions. [2021-01-06 11:46:44,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 709 transitions. [2021-01-06 11:46:44,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:46:44,346 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:44,346 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:44,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:46:44,346 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:44,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:44,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1177924502, now seen corresponding path program 1 times [2021-01-06 11:46:44,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:44,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803725348] [2021-01-06 11:46:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 11:46:44,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803725348] [2021-01-06 11:46:44,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:44,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:46:44,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70621926] [2021-01-06 11:46:44,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:44,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:44,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:44,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:44,588 INFO L87 Difference]: Start difference. First operand 528 states and 709 transitions. Second operand 3 states. [2021-01-06 11:46:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:45,150 INFO L93 Difference]: Finished difference Result 1578 states and 2122 transitions. [2021-01-06 11:46:45,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:45,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2021-01-06 11:46:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:45,158 INFO L225 Difference]: With dead ends: 1578 [2021-01-06 11:46:45,159 INFO L226 Difference]: Without dead ends: 1052 [2021-01-06 11:46:45,160 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 [2021-01-06 11:46:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2021-01-06 11:46:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2021-01-06 11:46:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2021-01-06 11:46:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1365 transitions. [2021-01-06 11:46:45,193 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1365 transitions. Word has length 89 [2021-01-06 11:46:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:45,193 INFO L481 AbstractCegarLoop]: Abstraction has 1052 states and 1365 transitions. [2021-01-06 11:46:45,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1365 transitions. [2021-01-06 11:46:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 11:46:45,201 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:45,202 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:45,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:46:45,203 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:45,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:45,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1044945499, now seen corresponding path program 1 times [2021-01-06 11:46:45,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:45,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754406627] [2021-01-06 11:46:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:46:45,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754406627] [2021-01-06 11:46:45,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:45,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:46:45,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019375056] [2021-01-06 11:46:45,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:45,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:45,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:45,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:45,325 INFO L87 Difference]: Start difference. First operand 1052 states and 1365 transitions. Second operand 3 states. [2021-01-06 11:46:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:45,908 INFO L93 Difference]: Finished difference Result 2233 states and 2920 transitions. [2021-01-06 11:46:45,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:45,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2021-01-06 11:46:45,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:45,917 INFO L225 Difference]: With dead ends: 2233 [2021-01-06 11:46:45,917 INFO L226 Difference]: Without dead ends: 1314 [2021-01-06 11:46:45,920 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 [2021-01-06 11:46:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2021-01-06 11:46:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2021-01-06 11:46:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2021-01-06 11:46:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1503 transitions. [2021-01-06 11:46:45,954 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1503 transitions. Word has length 95 [2021-01-06 11:46:45,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:45,954 INFO L481 AbstractCegarLoop]: Abstraction has 1183 states and 1503 transitions. [2021-01-06 11:46:45,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1503 transitions. [2021-01-06 11:46:45,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:46:45,961 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:45,961 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:45,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:46:45,961 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:45,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:45,962 INFO L82 PathProgramCache]: Analyzing trace with hash 646790435, now seen corresponding path program 1 times [2021-01-06 11:46:45,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:45,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633526483] [2021-01-06 11:46:45,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 11:46:46,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633526483] [2021-01-06 11:46:46,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:46,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:46:46,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658500444] [2021-01-06 11:46:46,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:46,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:46,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:46,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:46,094 INFO L87 Difference]: Start difference. First operand 1183 states and 1503 transitions. Second operand 3 states. [2021-01-06 11:46:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:46,723 INFO L93 Difference]: Finished difference Result 2364 states and 3004 transitions. [2021-01-06 11:46:46,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:46,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-06 11:46:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:46,730 INFO L225 Difference]: With dead ends: 2364 [2021-01-06 11:46:46,730 INFO L226 Difference]: Without dead ends: 1183 [2021-01-06 11:46:46,732 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 [2021-01-06 11:46:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2021-01-06 11:46:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2021-01-06 11:46:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2021-01-06 11:46:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1497 transitions. [2021-01-06 11:46:46,781 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1497 transitions. Word has length 99 [2021-01-06 11:46:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:46,782 INFO L481 AbstractCegarLoop]: Abstraction has 1183 states and 1497 transitions. [2021-01-06 11:46:46,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1497 transitions. [2021-01-06 11:46:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-01-06 11:46:46,784 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:46,785 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:46,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:46:46,785 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:46,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:46,786 INFO L82 PathProgramCache]: Analyzing trace with hash -209373307, now seen corresponding path program 1 times [2021-01-06 11:46:46,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:46,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51888284] [2021-01-06 11:46:46,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 11:46:46,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51888284] [2021-01-06 11:46:46,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:46,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:46:46,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227426139] [2021-01-06 11:46:46,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:46,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:46,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:46,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:46,843 INFO L87 Difference]: Start difference. First operand 1183 states and 1497 transitions. Second operand 3 states. [2021-01-06 11:46:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:47,457 INFO L93 Difference]: Finished difference Result 3019 states and 3792 transitions. [2021-01-06 11:46:47,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:47,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2021-01-06 11:46:47,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:47,469 INFO L225 Difference]: With dead ends: 3019 [2021-01-06 11:46:47,469 INFO L226 Difference]: Without dead ends: 1838 [2021-01-06 11:46:47,472 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 [2021-01-06 11:46:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2021-01-06 11:46:47,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1445. [2021-01-06 11:46:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2021-01-06 11:46:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1807 transitions. [2021-01-06 11:46:47,520 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1807 transitions. Word has length 108 [2021-01-06 11:46:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:47,521 INFO L481 AbstractCegarLoop]: Abstraction has 1445 states and 1807 transitions. [2021-01-06 11:46:47,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1807 transitions. [2021-01-06 11:46:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-01-06 11:46:47,524 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:47,524 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:47,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:46:47,525 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:47,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1571139521, now seen corresponding path program 1 times [2021-01-06 11:46:47,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:47,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961386602] [2021-01-06 11:46:47,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 11:46:47,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961386602] [2021-01-06 11:46:47,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:47,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:46:47,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880885833] [2021-01-06 11:46:47,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:47,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:47,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:47,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:47,613 INFO L87 Difference]: Start difference. First operand 1445 states and 1807 transitions. Second operand 3 states. [2021-01-06 11:46:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:48,118 INFO L93 Difference]: Finished difference Result 2888 states and 3612 transitions. [2021-01-06 11:46:48,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:48,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2021-01-06 11:46:48,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:48,126 INFO L225 Difference]: With dead ends: 2888 [2021-01-06 11:46:48,126 INFO L226 Difference]: Without dead ends: 1445 [2021-01-06 11:46:48,129 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 [2021-01-06 11:46:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2021-01-06 11:46:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2021-01-06 11:46:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2021-01-06 11:46:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1789 transitions. [2021-01-06 11:46:48,166 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1789 transitions. Word has length 124 [2021-01-06 11:46:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:48,166 INFO L481 AbstractCegarLoop]: Abstraction has 1445 states and 1789 transitions. [2021-01-06 11:46:48,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1789 transitions. [2021-01-06 11:46:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 11:46:48,169 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:48,170 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:48,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:46:48,170 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:48,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:48,171 INFO L82 PathProgramCache]: Analyzing trace with hash 471270007, now seen corresponding path program 1 times [2021-01-06 11:46:48,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:48,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488731373] [2021-01-06 11:46:48,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 11:46:48,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488731373] [2021-01-06 11:46:48,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283371140] [2021-01-06 11:46:48,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/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 [2021-01-06 11:46:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:48,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:46:48,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-06 11:46:48,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:46:48,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 11:46:48,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922736671] [2021-01-06 11:46:48,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:48,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:48,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:48,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:48,686 INFO L87 Difference]: Start difference. First operand 1445 states and 1789 transitions. Second operand 3 states. [2021-01-06 11:46:49,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:49,308 INFO L93 Difference]: Finished difference Result 3281 states and 4055 transitions. [2021-01-06 11:46:49,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:49,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2021-01-06 11:46:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:49,320 INFO L225 Difference]: With dead ends: 3281 [2021-01-06 11:46:49,320 INFO L226 Difference]: Without dead ends: 1838 [2021-01-06 11:46:49,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2021-01-06 11:46:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1445. [2021-01-06 11:46:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2021-01-06 11:46:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1789 transitions. [2021-01-06 11:46:49,370 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1789 transitions. Word has length 128 [2021-01-06 11:46:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:49,372 INFO L481 AbstractCegarLoop]: Abstraction has 1445 states and 1789 transitions. [2021-01-06 11:46:49,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1789 transitions. [2021-01-06 11:46:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 11:46:49,376 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:49,376 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2021-01-06 11:46:49,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-01-06 11:46:49,590 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:49,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:49,591 INFO L82 PathProgramCache]: Analyzing trace with hash -722545416, now seen corresponding path program 1 times [2021-01-06 11:46:49,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:49,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746313436] [2021-01-06 11:46:49,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 74 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 11:46:49,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746313436] [2021-01-06 11:46:49,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201798028] [2021-01-06 11:46:49,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/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 [2021-01-06 11:46:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:49,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:46:49,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-01-06 11:46:50,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:46:50,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 11:46:50,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64267743] [2021-01-06 11:46:50,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:50,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:50,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:50,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:50,121 INFO L87 Difference]: Start difference. First operand 1445 states and 1789 transitions. Second operand 3 states. [2021-01-06 11:46:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:50,704 INFO L93 Difference]: Finished difference Result 3281 states and 4078 transitions. [2021-01-06 11:46:50,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:50,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2021-01-06 11:46:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:50,713 INFO L225 Difference]: With dead ends: 3281 [2021-01-06 11:46:50,714 INFO L226 Difference]: Without dead ends: 1838 [2021-01-06 11:46:50,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2021-01-06 11:46:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2021-01-06 11:46:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2021-01-06 11:46:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2093 transitions. [2021-01-06 11:46:50,758 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2093 transitions. Word has length 151 [2021-01-06 11:46:50,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:50,758 INFO L481 AbstractCegarLoop]: Abstraction has 1707 states and 2093 transitions. [2021-01-06 11:46:50,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2093 transitions. [2021-01-06 11:46:50,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-01-06 11:46:50,762 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:50,763 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 11:46:50,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:50,977 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:50,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:50,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1579858973, now seen corresponding path program 1 times [2021-01-06 11:46:50,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:50,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101804735] [2021-01-06 11:46:50,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-01-06 11:46:51,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101804735] [2021-01-06 11:46:51,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925491592] [2021-01-06 11:46:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/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 [2021-01-06 11:46:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:51,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:46:51,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:46:51,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:46:51,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2021-01-06 11:46:51,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335919621] [2021-01-06 11:46:51,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:46:51,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:51,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:46:51,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:46:51,462 INFO L87 Difference]: Start difference. First operand 1707 states and 2093 transitions. Second operand 4 states. [2021-01-06 11:46:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:52,416 INFO L93 Difference]: Finished difference Result 3936 states and 4749 transitions. [2021-01-06 11:46:52,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:46:52,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2021-01-06 11:46:52,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:52,426 INFO L225 Difference]: With dead ends: 3936 [2021-01-06 11:46:52,426 INFO L226 Difference]: Without dead ends: 2100 [2021-01-06 11:46:52,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:46:52,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2021-01-06 11:46:52,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1707. [2021-01-06 11:46:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2021-01-06 11:46:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1966 transitions. [2021-01-06 11:46:52,471 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1966 transitions. Word has length 164 [2021-01-06 11:46:52,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:52,471 INFO L481 AbstractCegarLoop]: Abstraction has 1707 states and 1966 transitions. [2021-01-06 11:46:52,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:46:52,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1966 transitions. [2021-01-06 11:46:52,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-01-06 11:46:52,477 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:52,478 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 11:46:52,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 11:46:52,694 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:52,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:52,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1361301574, now seen corresponding path program 1 times [2021-01-06 11:46:52,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:52,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285001541] [2021-01-06 11:46:52,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:46:52,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285001541] [2021-01-06 11:46:52,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022652738] [2021-01-06 11:46:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:53,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:46:53,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-01-06 11:46:53,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:46:53,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 11:46:53,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374492411] [2021-01-06 11:46:53,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:53,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:53,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:53,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:46:53,467 INFO L87 Difference]: Start difference. First operand 1707 states and 1966 transitions. Second operand 3 states. [2021-01-06 11:46:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:54,019 INFO L93 Difference]: Finished difference Result 3805 states and 4388 transitions. [2021-01-06 11:46:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:54,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2021-01-06 11:46:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:54,031 INFO L225 Difference]: With dead ends: 3805 [2021-01-06 11:46:54,031 INFO L226 Difference]: Without dead ends: 2100 [2021-01-06 11:46:54,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:46:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2021-01-06 11:46:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2021-01-06 11:46:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2021-01-06 11:46:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2133 transitions. [2021-01-06 11:46:54,091 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2133 transitions. Word has length 181 [2021-01-06 11:46:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:54,091 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 2133 transitions. [2021-01-06 11:46:54,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2133 transitions. [2021-01-06 11:46:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-01-06 11:46:54,097 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:54,098 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 11:46:54,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:54,313 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:54,314 INFO L82 PathProgramCache]: Analyzing trace with hash -435769895, now seen corresponding path program 1 times [2021-01-06 11:46:54,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:54,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010077263] [2021-01-06 11:46:54,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2021-01-06 11:46:54,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010077263] [2021-01-06 11:46:54,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501778495] [2021-01-06 11:46:54,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:54,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:46:54,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2021-01-06 11:46:54,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:46:54,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 11:46:54,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108631490] [2021-01-06 11:46:54,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:54,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:54,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:54,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:54,799 INFO L87 Difference]: Start difference. First operand 1838 states and 2133 transitions. Second operand 3 states. [2021-01-06 11:46:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:55,332 INFO L93 Difference]: Finished difference Result 3805 states and 4417 transitions. [2021-01-06 11:46:55,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:55,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2021-01-06 11:46:55,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:55,343 INFO L225 Difference]: With dead ends: 3805 [2021-01-06 11:46:55,343 INFO L226 Difference]: Without dead ends: 1969 [2021-01-06 11:46:55,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2021-01-06 11:46:55,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2021-01-06 11:46:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2021-01-06 11:46:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2071 transitions. [2021-01-06 11:46:55,400 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2071 transitions. Word has length 186 [2021-01-06 11:46:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:55,401 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 2071 transitions. [2021-01-06 11:46:55,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2071 transitions. [2021-01-06 11:46:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-01-06 11:46:55,406 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:55,407 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:55,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 11:46:55,622 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:55,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:55,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1220414981, now seen corresponding path program 1 times [2021-01-06 11:46:55,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:55,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274678063] [2021-01-06 11:46:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2021-01-06 11:46:55,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274678063] [2021-01-06 11:46:55,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505779664] [2021-01-06 11:46:55,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:55,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:46:55,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-01-06 11:46:56,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:46:56,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 11:46:56,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816147344] [2021-01-06 11:46:56,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:56,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:56,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:56,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:56,056 INFO L87 Difference]: Start difference. First operand 1838 states and 2071 transitions. Second operand 3 states. [2021-01-06 11:46:56,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:56,674 INFO L93 Difference]: Finished difference Result 4067 states and 4579 transitions. [2021-01-06 11:46:56,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:56,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2021-01-06 11:46:56,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:56,684 INFO L225 Difference]: With dead ends: 4067 [2021-01-06 11:46:56,685 INFO L226 Difference]: Without dead ends: 2231 [2021-01-06 11:46:56,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:56,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2021-01-06 11:46:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2021-01-06 11:46:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2021-01-06 11:46:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2337 transitions. [2021-01-06 11:46:56,732 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2337 transitions. Word has length 206 [2021-01-06 11:46:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:56,733 INFO L481 AbstractCegarLoop]: Abstraction has 2100 states and 2337 transitions. [2021-01-06 11:46:56,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2337 transitions. [2021-01-06 11:46:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2021-01-06 11:46:56,738 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:56,739 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:56,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:56,954 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:56,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:56,955 INFO L82 PathProgramCache]: Analyzing trace with hash -477520136, now seen corresponding path program 1 times [2021-01-06 11:46:56,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:56,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216781638] [2021-01-06 11:46:56,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 117 proven. 3 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2021-01-06 11:46:57,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216781638] [2021-01-06 11:46:57,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446188417] [2021-01-06 11:46:57,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:57,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:46:57,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-01-06 11:46:57,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:46:57,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 11:46:57,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713423442] [2021-01-06 11:46:57,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:57,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:57,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:57,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:57,435 INFO L87 Difference]: Start difference. First operand 2100 states and 2337 transitions. Second operand 3 states. [2021-01-06 11:46:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:58,017 INFO L93 Difference]: Finished difference Result 4591 states and 5116 transitions. [2021-01-06 11:46:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:58,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2021-01-06 11:46:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:58,030 INFO L225 Difference]: With dead ends: 4591 [2021-01-06 11:46:58,030 INFO L226 Difference]: Without dead ends: 2493 [2021-01-06 11:46:58,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2021-01-06 11:46:58,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2100. [2021-01-06 11:46:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2021-01-06 11:46:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2336 transitions. [2021-01-06 11:46:58,091 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2336 transitions. Word has length 223 [2021-01-06 11:46:58,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:58,091 INFO L481 AbstractCegarLoop]: Abstraction has 2100 states and 2336 transitions. [2021-01-06 11:46:58,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2336 transitions. [2021-01-06 11:46:58,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2021-01-06 11:46:58,100 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:58,101 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:46:58,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 11:46:58,314 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:58,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1449554319, now seen corresponding path program 1 times [2021-01-06 11:46:58,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:58,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600684727] [2021-01-06 11:46:58,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:46:58,438 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:46:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:46:58,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:46:58,642 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:46:58,642 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:46:58,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:46:58,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:46:58 BoogieIcfgContainer [2021-01-06 11:46:58,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:46:58,882 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:46:58,882 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:46:58,882 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:46:58,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:46:42" (3/4) ... [2021-01-06 11:46:58,885 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 11:46:59,175 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem01_label38.c-witness.graphml [2021-01-06 11:46:59,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:46:59,177 INFO L168 Benchmark]: Toolchain (without parser) took 19526.94 ms. Allocated memory was 157.3 MB in the beginning and 440.4 MB in the end (delta: 283.1 MB). Free memory was 130.4 MB in the beginning and 250.2 MB in the end (delta: -119.8 MB). Peak memory consumption was 164.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:59,177 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 157.3 MB. Free memory is still 130.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:46:59,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.86 ms. Allocated memory is still 157.3 MB. Free memory was 130.2 MB in the beginning and 135.7 MB in the end (delta: -5.5 MB). Peak memory consumption was 29.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:59,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.60 ms. Allocated memory is still 157.3 MB. Free memory was 135.7 MB in the beginning and 129.9 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:59,178 INFO L168 Benchmark]: Boogie Preprocessor took 102.80 ms. Allocated memory is still 157.3 MB. Free memory was 129.9 MB in the beginning and 125.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:59,179 INFO L168 Benchmark]: RCFGBuilder took 1463.35 ms. Allocated memory was 157.3 MB in the beginning and 197.1 MB in the end (delta: 39.8 MB). Free memory was 125.2 MB in the beginning and 144.7 MB in the end (delta: -19.4 MB). Peak memory consumption was 83.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:59,179 INFO L168 Benchmark]: TraceAbstraction took 16705.99 ms. Allocated memory was 197.1 MB in the beginning and 440.4 MB in the end (delta: 243.3 MB). Free memory was 144.7 MB in the beginning and 290.0 MB in the end (delta: -145.4 MB). Peak memory consumption was 98.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:59,180 INFO L168 Benchmark]: Witness Printer took 293.54 ms. Allocated memory is still 440.4 MB. Free memory was 290.0 MB in the beginning and 250.2 MB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:59,182 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.20 ms. Allocated memory is still 157.3 MB. Free memory is still 130.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 801.86 ms. Allocated memory is still 157.3 MB. Free memory was 130.2 MB in the beginning and 135.7 MB in the end (delta: -5.5 MB). Peak memory consumption was 29.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 143.60 ms. Allocated memory is still 157.3 MB. Free memory was 135.7 MB in the beginning and 129.9 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 102.80 ms. Allocated memory is still 157.3 MB. Free memory was 129.9 MB in the beginning and 125.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1463.35 ms. Allocated memory was 157.3 MB in the beginning and 197.1 MB in the end (delta: 39.8 MB). Free memory was 125.2 MB in the beginning and 144.7 MB in the end (delta: -19.4 MB). Peak memory consumption was 83.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16705.99 ms. Allocated memory was 197.1 MB in the beginning and 440.4 MB in the end (delta: 243.3 MB). Free memory was 144.7 MB in the beginning and 290.0 MB in the end (delta: -145.4 MB). Peak memory consumption was 98.4 MB. Max. memory is 8.0 GB. * Witness Printer took 293.54 ms. Allocated memory is still 440.4 MB. Free memory was 290.0 MB in the beginning and 250.2 MB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 432]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND TRUE (((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8)) [L289] a20 = 1 [L290] a8 = 13 [L291] a16 = 4 [L292] a7 = 0 [L293] a21 = 1 [L294] a17 = 0 [L295] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, 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)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, 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)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L431] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L432] reach_error() VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, 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, 198 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.3s, OverallIterations: 15, TraceHistogramMax: 6, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 990 SDtfs, 1482 SDslu, 76 SDs, 0 SdLazy, 5022 SolverSat, 819 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1270 GetRequests, 1239 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 2358 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3409 NumberOfCodeBlocks, 3409 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3142 ConstructedInterpolants, 0 QuantifiedInterpolants, 1497365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2582 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 2338/2411 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...