/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_label32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:46:28,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:46:28,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:46:28,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:46:28,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:46:28,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:46:28,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:46:28,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:46:28,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:46:28,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:46:28,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:46:28,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:46:28,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:46:28,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:46:28,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:46:28,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:46:28,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:46:28,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:46:28,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:46:28,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:46:28,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:46:28,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:46:28,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:46:28,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:46:28,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:46:28,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:46:28,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:46:28,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:46:28,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:46:28,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:46:28,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:46:28,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:46:28,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:46:28,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:46:28,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:46:28,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:46:28,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:46:28,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:46:28,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:46:28,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:46:28,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:46:28,638 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:28,686 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:46:28,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:46:28,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:46:28,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:46:28,693 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:46:28,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:46:28,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:46:28,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:46:28,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:46:28,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:46:28,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:46:28,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:46:28,697 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:46:28,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:46:28,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:46:28,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:46:28,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:46:28,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:46:28,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:46:28,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:46:28,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:46:28,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:46:28,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:46:28,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:46:28,700 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:46:28,701 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:29,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:46:29,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:46:29,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:46:29,243 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:46:29,246 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:46:29,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label32.c [2021-01-06 11:46:29,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8254e0e63/c17b98dbcf2446b69d56b7183f6d0b45/FLAGa232ac1a8 [2021-01-06 11:46:30,102 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:46:30,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label32.c [2021-01-06 11:46:30,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8254e0e63/c17b98dbcf2446b69d56b7183f6d0b45/FLAGa232ac1a8 [2021-01-06 11:46:30,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8254e0e63/c17b98dbcf2446b69d56b7183f6d0b45 [2021-01-06 11:46:30,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:46:30,351 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:46:30,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:46:30,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:46:30,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:46:30,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:46:30" (1/1) ... [2021-01-06 11:46:30,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d8008e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:30, skipping insertion in model container [2021-01-06 11:46:30,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:46:30" (1/1) ... [2021-01-06 11:46:30,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:46:30,448 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:30,962 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_label32.c[14752,14765] 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:31,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:46:31,035 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:31,114 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_label32.c[14752,14765] 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:31,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:46:31,155 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:46:31,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:31 WrapperNode [2021-01-06 11:46:31,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:46:31,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:46:31,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:46:31,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:46:31,166 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:31" (1/1) ... [2021-01-06 11:46:31,187 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:31" (1/1) ... [2021-01-06 11:46:31,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:46:31,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:46:31,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:46:31,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:46:31,256 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:31" (1/1) ... [2021-01-06 11:46:31,256 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:31" (1/1) ... [2021-01-06 11:46:31,262 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:31" (1/1) ... [2021-01-06 11:46:31,262 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:31" (1/1) ... [2021-01-06 11:46:31,316 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:31" (1/1) ... [2021-01-06 11:46:31,335 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:31" (1/1) ... [2021-01-06 11:46:31,348 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:31" (1/1) ... [2021-01-06 11:46:31,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:46:31,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:46:31,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:46:31,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:46:31,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:31" (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:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:46:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:46:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:46:31,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:46:32,811 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:46:32,811 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:46:32,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:46:32 BoogieIcfgContainer [2021-01-06 11:46:32,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:46:32,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:46:32,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:46:32,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:46:32,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:46:30" (1/3) ... [2021-01-06 11:46:32,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495bc555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:46:32, skipping insertion in model container [2021-01-06 11:46:32,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:46:31" (2/3) ... [2021-01-06 11:46:32,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495bc555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:46:32, skipping insertion in model container [2021-01-06 11:46:32,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:46:32" (3/3) ... [2021-01-06 11:46:32,824 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label32.c [2021-01-06 11:46:32,831 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:46:32,843 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:46:32,861 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:46:32,889 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:46:32,889 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:46:32,889 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:46:32,890 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:46:32,890 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:46:32,890 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:46:32,890 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:46:32,890 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:46:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2021-01-06 11:46:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:46:32,919 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:32,920 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] [2021-01-06 11:46:32,920 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:32,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:32,926 INFO L82 PathProgramCache]: Analyzing trace with hash -87240969, now seen corresponding path program 1 times [2021-01-06 11:46:32,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:32,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069200919] [2021-01-06 11:46:32,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:33,422 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:33,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069200919] [2021-01-06 11:46:33,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:33,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:46:33,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178665932] [2021-01-06 11:46:33,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:33,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:33,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:33,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:33,458 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2021-01-06 11:46:34,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:34,306 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2021-01-06 11:46:34,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:34,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 11:46:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:34,324 INFO L225 Difference]: With dead ends: 528 [2021-01-06 11:46:34,324 INFO L226 Difference]: Without dead ends: 266 [2021-01-06 11:46:34,328 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:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-01-06 11:46:34,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-01-06 11:46:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2021-01-06 11:46:34,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2021-01-06 11:46:34,390 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 74 [2021-01-06 11:46:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:34,391 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2021-01-06 11:46:34,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2021-01-06 11:46:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 11:46:34,394 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:34,395 INFO L422 BasicCegarLoop]: trace histogram [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:34,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:46:34,395 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:34,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:34,396 INFO L82 PathProgramCache]: Analyzing trace with hash -620298449, now seen corresponding path program 1 times [2021-01-06 11:46:34,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:34,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202348386] [2021-01-06 11:46:34,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:34,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 11:46:34,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202348386] [2021-01-06 11:46:34,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:34,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:46:34,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257580881] [2021-01-06 11:46:34,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:34,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:34,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:34,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:34,569 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand 3 states. [2021-01-06 11:46:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:35,085 INFO L93 Difference]: Finished difference Result 792 states and 1117 transitions. [2021-01-06 11:46:35,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:35,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 11:46:35,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:35,090 INFO L225 Difference]: With dead ends: 792 [2021-01-06 11:46:35,091 INFO L226 Difference]: Without dead ends: 528 [2021-01-06 11:46:35,093 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:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-01-06 11:46:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2021-01-06 11:46:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2021-01-06 11:46:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions. [2021-01-06 11:46:35,128 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 78 [2021-01-06 11:46:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:35,129 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 720 transitions. [2021-01-06 11:46:35,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:35,129 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions. [2021-01-06 11:46:35,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 11:46:35,143 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:35,145 INFO L422 BasicCegarLoop]: trace histogram [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:35,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:46:35,145 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:35,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:35,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1138348337, now seen corresponding path program 1 times [2021-01-06 11:46:35,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:35,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758527326] [2021-01-06 11:46:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:46:35,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758527326] [2021-01-06 11:46:35,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:35,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:46:35,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060459703] [2021-01-06 11:46:35,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:35,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:35,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:35,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:35,246 INFO L87 Difference]: Start difference. First operand 528 states and 720 transitions. Second operand 3 states. [2021-01-06 11:46:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:35,919 INFO L93 Difference]: Finished difference Result 1578 states and 2155 transitions. [2021-01-06 11:46:35,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:35,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2021-01-06 11:46:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:35,927 INFO L225 Difference]: With dead ends: 1578 [2021-01-06 11:46:35,927 INFO L226 Difference]: Without dead ends: 1052 [2021-01-06 11:46:35,929 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:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2021-01-06 11:46:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2021-01-06 11:46:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2021-01-06 11:46:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1364 transitions. [2021-01-06 11:46:35,982 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1364 transitions. Word has length 79 [2021-01-06 11:46:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:35,983 INFO L481 AbstractCegarLoop]: Abstraction has 1052 states and 1364 transitions. [2021-01-06 11:46:35,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1364 transitions. [2021-01-06 11:46:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 11:46:35,991 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:35,991 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:35,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:46:35,992 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:35,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:35,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1725775258, now seen corresponding path program 1 times [2021-01-06 11:46:35,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:35,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904326089] [2021-01-06 11:46:35,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 11:46:36,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904326089] [2021-01-06 11:46:36,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:36,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:46:36,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690673190] [2021-01-06 11:46:36,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:36,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:36,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:36,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:36,121 INFO L87 Difference]: Start difference. First operand 1052 states and 1364 transitions. Second operand 3 states. [2021-01-06 11:46:36,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:36,859 INFO L93 Difference]: Finished difference Result 2888 states and 3759 transitions. [2021-01-06 11:46:36,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:36,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2021-01-06 11:46:36,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:36,871 INFO L225 Difference]: With dead ends: 2888 [2021-01-06 11:46:36,871 INFO L226 Difference]: Without dead ends: 1838 [2021-01-06 11:46:36,878 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:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2021-01-06 11:46:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1183. [2021-01-06 11:46:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2021-01-06 11:46:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1489 transitions. [2021-01-06 11:46:36,945 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1489 transitions. Word has length 94 [2021-01-06 11:46:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:36,946 INFO L481 AbstractCegarLoop]: Abstraction has 1183 states and 1489 transitions. [2021-01-06 11:46:36,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1489 transitions. [2021-01-06 11:46:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 11:46:36,957 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:36,957 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:36,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:46:36,957 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:36,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:36,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1793438628, now seen corresponding path program 1 times [2021-01-06 11:46:36,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:36,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337959663] [2021-01-06 11:46:36,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:46:37,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337959663] [2021-01-06 11:46:37,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:37,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:46:37,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054979577] [2021-01-06 11:46:37,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:37,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:37,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:37,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:37,093 INFO L87 Difference]: Start difference. First operand 1183 states and 1489 transitions. Second operand 3 states. [2021-01-06 11:46:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:37,750 INFO L93 Difference]: Finished difference Result 3543 states and 4462 transitions. [2021-01-06 11:46:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:37,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2021-01-06 11:46:37,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:37,764 INFO L225 Difference]: With dead ends: 3543 [2021-01-06 11:46:37,764 INFO L226 Difference]: Without dead ends: 2362 [2021-01-06 11:46:37,767 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:37,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2021-01-06 11:46:37,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2100. [2021-01-06 11:46:37,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2021-01-06 11:46:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2569 transitions. [2021-01-06 11:46:37,829 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2569 transitions. Word has length 97 [2021-01-06 11:46:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:37,830 INFO L481 AbstractCegarLoop]: Abstraction has 2100 states and 2569 transitions. [2021-01-06 11:46:37,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2569 transitions. [2021-01-06 11:46:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 11:46:37,834 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:37,834 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 11:46:37,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:46:37,835 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:37,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:37,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1285522022, now seen corresponding path program 1 times [2021-01-06 11:46:37,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:37,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8104175] [2021-01-06 11:46:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 11:46:37,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8104175] [2021-01-06 11:46:37,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:37,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:46:37,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389408501] [2021-01-06 11:46:37,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:37,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:37,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:37,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:37,907 INFO L87 Difference]: Start difference. First operand 2100 states and 2569 transitions. Second operand 3 states. [2021-01-06 11:46:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:38,478 INFO L93 Difference]: Finished difference Result 4460 states and 5416 transitions. [2021-01-06 11:46:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:38,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2021-01-06 11:46:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:38,491 INFO L225 Difference]: With dead ends: 4460 [2021-01-06 11:46:38,491 INFO L226 Difference]: Without dead ends: 2231 [2021-01-06 11:46:38,495 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:38,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2021-01-06 11:46:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2231. [2021-01-06 11:46:38,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2021-01-06 11:46:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2494 transitions. [2021-01-06 11:46:38,550 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2494 transitions. Word has length 101 [2021-01-06 11:46:38,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:38,550 INFO L481 AbstractCegarLoop]: Abstraction has 2231 states and 2494 transitions. [2021-01-06 11:46:38,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2494 transitions. [2021-01-06 11:46:38,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 11:46:38,554 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:38,555 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:46:38,555 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:38,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:38,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1577183842, now seen corresponding path program 1 times [2021-01-06 11:46:38,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:38,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425044223] [2021-01-06 11:46:38,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-06 11:46:38,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425044223] [2021-01-06 11:46:38,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:38,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:46:38,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507149070] [2021-01-06 11:46:38,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:38,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:38,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:38,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:38,700 INFO L87 Difference]: Start difference. First operand 2231 states and 2494 transitions. Second operand 3 states. [2021-01-06 11:46:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:39,187 INFO L93 Difference]: Finished difference Result 4329 states and 4848 transitions. [2021-01-06 11:46:39,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:39,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 11:46:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:39,200 INFO L225 Difference]: With dead ends: 4329 [2021-01-06 11:46:39,200 INFO L226 Difference]: Without dead ends: 2231 [2021-01-06 11:46:39,204 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:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2021-01-06 11:46:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2021-01-06 11:46:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2021-01-06 11:46:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2314 transitions. [2021-01-06 11:46:39,254 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2314 transitions. Word has length 105 [2021-01-06 11:46:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:39,254 INFO L481 AbstractCegarLoop]: Abstraction has 2100 states and 2314 transitions. [2021-01-06 11:46:39,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2314 transitions. [2021-01-06 11:46:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 11:46:39,258 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:39,259 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:46:39,259 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:39,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1807291204, now seen corresponding path program 1 times [2021-01-06 11:46:39,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:39,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372853431] [2021-01-06 11:46:39,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-01-06 11:46:39,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372853431] [2021-01-06 11:46:39,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:39,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:46:39,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088236632] [2021-01-06 11:46:39,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:39,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:39,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:39,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:39,315 INFO L87 Difference]: Start difference. First operand 2100 states and 2314 transitions. Second operand 3 states. [2021-01-06 11:46:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:39,891 INFO L93 Difference]: Finished difference Result 4984 states and 5536 transitions. [2021-01-06 11:46:39,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:39,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2021-01-06 11:46:39,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:39,908 INFO L225 Difference]: With dead ends: 4984 [2021-01-06 11:46:39,908 INFO L226 Difference]: Without dead ends: 3017 [2021-01-06 11:46:39,912 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:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2021-01-06 11:46:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 2624. [2021-01-06 11:46:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2021-01-06 11:46:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 2928 transitions. [2021-01-06 11:46:39,977 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 2928 transitions. Word has length 114 [2021-01-06 11:46:39,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:39,978 INFO L481 AbstractCegarLoop]: Abstraction has 2624 states and 2928 transitions. [2021-01-06 11:46:39,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 2928 transitions. [2021-01-06 11:46:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-06 11:46:39,982 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:39,982 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:46:39,983 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:39,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:39,983 INFO L82 PathProgramCache]: Analyzing trace with hash -341624706, now seen corresponding path program 1 times [2021-01-06 11:46:39,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:39,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630841406] [2021-01-06 11:46:39,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-01-06 11:46:40,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630841406] [2021-01-06 11:46:40,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:46:40,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:46:40,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633795908] [2021-01-06 11:46:40,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:40,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:40,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:46:40,066 INFO L87 Difference]: Start difference. First operand 2624 states and 2928 transitions. Second operand 3 states. [2021-01-06 11:46:40,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:40,571 INFO L93 Difference]: Finished difference Result 5508 states and 6150 transitions. [2021-01-06 11:46:40,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:40,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2021-01-06 11:46:40,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:40,586 INFO L225 Difference]: With dead ends: 5508 [2021-01-06 11:46:40,586 INFO L226 Difference]: Without dead ends: 2886 [2021-01-06 11:46:40,590 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:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2021-01-06 11:46:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2886. [2021-01-06 11:46:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2886 states. [2021-01-06 11:46:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 3204 transitions. [2021-01-06 11:46:40,653 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 3204 transitions. Word has length 130 [2021-01-06 11:46:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:40,653 INFO L481 AbstractCegarLoop]: Abstraction has 2886 states and 3204 transitions. [2021-01-06 11:46:40,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 3204 transitions. [2021-01-06 11:46:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 11:46:40,658 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:40,659 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:46:40,659 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:40,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash -806395722, now seen corresponding path program 1 times [2021-01-06 11:46:40,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:40,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798678260] [2021-01-06 11:46:40,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-01-06 11:46:40,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798678260] [2021-01-06 11:46:40,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726235637] [2021-01-06 11:46:40,757 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:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:40,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:46:40,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-01-06 11:46:41,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:46:41,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 11:46:41,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530433943] [2021-01-06 11:46:41,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:41,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:41,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:41,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:41,117 INFO L87 Difference]: Start difference. First operand 2886 states and 3204 transitions. Second operand 3 states. [2021-01-06 11:46:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:41,720 INFO L93 Difference]: Finished difference Result 5639 states and 6272 transitions. [2021-01-06 11:46:41,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:41,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2021-01-06 11:46:41,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:41,738 INFO L225 Difference]: With dead ends: 5639 [2021-01-06 11:46:41,738 INFO L226 Difference]: Without dead ends: 2886 [2021-01-06 11:46:41,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 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:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2021-01-06 11:46:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2886. [2021-01-06 11:46:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2886 states. [2021-01-06 11:46:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 3180 transitions. [2021-01-06 11:46:41,806 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 3180 transitions. Word has length 134 [2021-01-06 11:46:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:41,806 INFO L481 AbstractCegarLoop]: Abstraction has 2886 states and 3180 transitions. [2021-01-06 11:46:41,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 3180 transitions. [2021-01-06 11:46:41,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-01-06 11:46:41,811 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:41,812 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, 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] [2021-01-06 11:46:42,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 11:46:42,023 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:42,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1826015714, now seen corresponding path program 1 times [2021-01-06 11:46:42,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:42,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774448744] [2021-01-06 11:46:42,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-01-06 11:46:42,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774448744] [2021-01-06 11:46:42,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523618641] [2021-01-06 11:46:42,117 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:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:42,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:46:42,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-01-06 11:46:42,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:46:42,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2021-01-06 11:46:42,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714007740] [2021-01-06 11:46:42,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:46:42,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:42,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:46:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:46:42,477 INFO L87 Difference]: Start difference. First operand 2886 states and 3180 transitions. Second operand 4 states. [2021-01-06 11:46:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:43,383 INFO L93 Difference]: Finished difference Result 6163 states and 6831 transitions. [2021-01-06 11:46:43,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:46:43,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2021-01-06 11:46:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:43,400 INFO L225 Difference]: With dead ends: 6163 [2021-01-06 11:46:43,401 INFO L226 Difference]: Without dead ends: 3148 [2021-01-06 11:46:43,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 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:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2021-01-06 11:46:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 1969. [2021-01-06 11:46:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2021-01-06 11:46:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2176 transitions. [2021-01-06 11:46:43,461 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2176 transitions. Word has length 139 [2021-01-06 11:46:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:43,461 INFO L481 AbstractCegarLoop]: Abstraction has 1969 states and 2176 transitions. [2021-01-06 11:46:43,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:46:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2176 transitions. [2021-01-06 11:46:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-01-06 11:46:43,468 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:43,468 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:43,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:43,683 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:43,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:43,684 INFO L82 PathProgramCache]: Analyzing trace with hash -920238171, now seen corresponding path program 1 times [2021-01-06 11:46:43,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:43,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37822517] [2021-01-06 11:46:43,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 106 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-01-06 11:46:43,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37822517] [2021-01-06 11:46:43,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233252633] [2021-01-06 11:46:43,819 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:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:43,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:46:43,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-01-06 11:46:44,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:46:44,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 11:46:44,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932972665] [2021-01-06 11:46:44,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:44,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:44,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:44,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:46:44,194 INFO L87 Difference]: Start difference. First operand 1969 states and 2176 transitions. Second operand 3 states. [2021-01-06 11:46:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:44,685 INFO L93 Difference]: Finished difference Result 3936 states and 4354 transitions. [2021-01-06 11:46:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:44,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2021-01-06 11:46:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:44,695 INFO L225 Difference]: With dead ends: 3936 [2021-01-06 11:46:44,696 INFO L226 Difference]: Without dead ends: 2100 [2021-01-06 11:46:44,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:46:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2021-01-06 11:46:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2021-01-06 11:46:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2021-01-06 11:46:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2172 transitions. [2021-01-06 11:46:44,766 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2172 transitions. Word has length 156 [2021-01-06 11:46:44,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:44,766 INFO L481 AbstractCegarLoop]: Abstraction has 1969 states and 2172 transitions. [2021-01-06 11:46:44,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2172 transitions. [2021-01-06 11:46:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-01-06 11:46:44,771 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:44,771 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 11:46:44,986 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:44,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:44,987 INFO L82 PathProgramCache]: Analyzing trace with hash 609559585, now seen corresponding path program 1 times [2021-01-06 11:46:44,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:44,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689580597] [2021-01-06 11:46:44,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 114 proven. 3 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2021-01-06 11:46:45,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689580597] [2021-01-06 11:46:45,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497332071] [2021-01-06 11:46:45,100 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:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:45,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:46:45,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-01-06 11:46:45,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:46:45,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 11:46:45,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026390516] [2021-01-06 11:46:45,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:45,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:45,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:45,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:45,399 INFO L87 Difference]: Start difference. First operand 1969 states and 2172 transitions. Second operand 3 states. [2021-01-06 11:46:45,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:45,904 INFO L93 Difference]: Finished difference Result 3936 states and 4354 transitions. [2021-01-06 11:46:45,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:45,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2021-01-06 11:46:45,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:45,917 INFO L225 Difference]: With dead ends: 3936 [2021-01-06 11:46:45,917 INFO L226 Difference]: Without dead ends: 2100 [2021-01-06 11:46:45,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 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:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2021-01-06 11:46:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2021-01-06 11:46:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2021-01-06 11:46:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2281 transitions. [2021-01-06 11:46:45,977 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2281 transitions. Word has length 195 [2021-01-06 11:46:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:45,977 INFO L481 AbstractCegarLoop]: Abstraction has 2100 states and 2281 transitions. [2021-01-06 11:46:45,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2281 transitions. [2021-01-06 11:46:45,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2021-01-06 11:46:45,985 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:45,985 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:46,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:46,201 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:46,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:46,202 INFO L82 PathProgramCache]: Analyzing trace with hash -798875378, now seen corresponding path program 1 times [2021-01-06 11:46:46,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:46,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130164891] [2021-01-06 11:46:46,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 166 proven. 125 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 11:46:46,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130164891] [2021-01-06 11:46:46,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483149836] [2021-01-06 11:46:46,656 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:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:46,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 11:46:46,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-01-06 11:46:47,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:46:47,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2021-01-06 11:46:47,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946917967] [2021-01-06 11:46:47,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:47,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:47,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:47,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:46:47,097 INFO L87 Difference]: Start difference. First operand 2100 states and 2281 transitions. Second operand 3 states. [2021-01-06 11:46:47,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:47,587 INFO L93 Difference]: Finished difference Result 4067 states and 4426 transitions. [2021-01-06 11:46:47,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:47,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2021-01-06 11:46:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:47,598 INFO L225 Difference]: With dead ends: 4067 [2021-01-06 11:46:47,598 INFO L226 Difference]: Without dead ends: 2100 [2021-01-06 11:46:47,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:46:47,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2021-01-06 11:46:47,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2021-01-06 11:46:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2021-01-06 11:46:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2268 transitions. [2021-01-06 11:46:47,645 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2268 transitions. Word has length 221 [2021-01-06 11:46:47,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:47,646 INFO L481 AbstractCegarLoop]: Abstraction has 2100 states and 2268 transitions. [2021-01-06 11:46:47,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2268 transitions. [2021-01-06 11:46:47,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2021-01-06 11:46:47,654 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:47,654 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:47,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 11:46:47,868 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:47,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:47,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1175600186, now seen corresponding path program 1 times [2021-01-06 11:46:47,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:47,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330048688] [2021-01-06 11:46:47,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:46:47,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:46:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:46:48,019 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:46:48,113 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:46:48,113 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:46:48,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:46:48,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:46:48 BoogieIcfgContainer [2021-01-06 11:46:48,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:46:48,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:46:48,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:46:48,377 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:46:48,377 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:32" (3/4) ... [2021-01-06 11:46:48,380 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 11:46:48,629 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem01_label32.c-witness.graphml [2021-01-06 11:46:48,629 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:46:48,631 INFO L168 Benchmark]: Toolchain (without parser) took 18280.45 ms. Allocated memory was 156.2 MB in the beginning and 395.3 MB in the end (delta: 239.1 MB). Free memory was 129.1 MB in the beginning and 260.2 MB in the end (delta: -131.1 MB). Peak memory consumption was 109.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:48,632 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 156.2 MB. Free memory is still 129.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:46:48,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.63 ms. Allocated memory is still 156.2 MB. Free memory was 128.8 MB in the beginning and 101.7 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:48,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.76 ms. Allocated memory is still 156.2 MB. Free memory was 101.7 MB in the beginning and 95.9 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:48,633 INFO L168 Benchmark]: Boogie Preprocessor took 116.46 ms. Allocated memory is still 156.2 MB. Free memory was 95.9 MB in the beginning and 133.6 MB in the end (delta: -37.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:48,633 INFO L168 Benchmark]: RCFGBuilder took 1451.18 ms. Allocated memory is still 156.2 MB. Free memory was 133.6 MB in the beginning and 113.3 MB in the end (delta: 20.3 MB). Peak memory consumption was 87.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:48,634 INFO L168 Benchmark]: TraceAbstraction took 15559.84 ms. Allocated memory was 156.2 MB in the beginning and 395.3 MB in the end (delta: 239.1 MB). Free memory was 112.7 MB in the beginning and 299.7 MB in the end (delta: -187.0 MB). Peak memory consumption was 52.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:48,634 INFO L168 Benchmark]: Witness Printer took 253.01 ms. Allocated memory is still 395.3 MB. Free memory was 299.7 MB in the beginning and 260.2 MB in the end (delta: 39.5 MB). Peak memory consumption was 39.8 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:48,636 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.24 ms. Allocated memory is still 156.2 MB. Free memory is still 129.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 801.63 ms. Allocated memory is still 156.2 MB. Free memory was 128.8 MB in the beginning and 101.7 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 86.76 ms. Allocated memory is still 156.2 MB. Free memory was 101.7 MB in the beginning and 95.9 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 116.46 ms. Allocated memory is still 156.2 MB. Free memory was 95.9 MB in the beginning and 133.6 MB in the end (delta: -37.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1451.18 ms. Allocated memory is still 156.2 MB. Free memory was 133.6 MB in the beginning and 113.3 MB in the end (delta: 20.3 MB). Peak memory consumption was 87.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15559.84 ms. Allocated memory was 156.2 MB in the beginning and 395.3 MB in the end (delta: 239.1 MB). Free memory was 112.7 MB in the beginning and 299.7 MB in the end (delta: -187.0 MB). Peak memory consumption was 52.1 MB. Max. memory is 8.0 GB. * Witness Printer took 253.01 ms. Allocated memory is still 395.3 MB. Free memory was 299.7 MB in the beginning and 260.2 MB in the end (delta: 39.5 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: 408]: 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 TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L159] a16 = 4 [L160] a17 = 0 [L161] return 25; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND TRUE (((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)) [L140] a8 = 15 [L141] a17 = 0 [L142] a21 = 1 [L143] a20 = 0 [L144] a16 = 4 [L145] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L408] reach_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.2s, OverallIterations: 15, TraceHistogramMax: 7, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 913 SDtfs, 1685 SDslu, 79 SDs, 0 SdLazy, 4740 SolverSat, 723 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 882 GetRequests, 853 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2886occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 2751 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2808 NumberOfCodeBlocks, 2808 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2543 ConstructedInterpolants, 0 QuantifiedInterpolants, 1094824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1955 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 2038/2178 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...