/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/Problem10_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 13:31:33,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 13:31:33,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 13:31:33,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 13:31:33,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 13:31:33,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 13:31:33,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 13:31:33,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 13:31:33,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 13:31:33,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 13:31:33,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 13:31:33,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 13:31:33,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 13:31:33,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 13:31:33,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 13:31:33,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 13:31:33,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 13:31:33,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 13:31:33,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 13:31:33,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 13:31:33,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 13:31:33,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 13:31:33,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 13:31:33,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 13:31:33,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 13:31:33,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 13:31:33,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 13:31:33,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 13:31:33,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 13:31:33,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 13:31:33,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 13:31:33,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 13:31:33,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 13:31:33,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 13:31:33,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 13:31:33,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 13:31:33,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 13:31:33,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 13:31:33,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 13:31:33,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 13:31:33,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 13:31:33,770 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 13:31:33,822 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 13:31:33,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 13:31:33,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 13:31:33,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 13:31:33,828 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 13:31:33,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 13:31:33,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 13:31:33,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 13:31:33,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 13:31:33,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 13:31:33,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 13:31:33,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 13:31:33,831 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 13:31:33,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 13:31:33,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 13:31:33,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 13:31:33,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 13:31:33,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 13:31:33,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 13:31:33,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 13:31:33,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 13:31:33,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 13:31:33,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 13:31:33,834 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 13:31:33,834 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 13:31:33,834 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 13:31:34,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 13:31:34,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 13:31:34,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 13:31:34,310 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 13:31:34,311 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 13:31:34,312 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label28.c [2021-01-06 13:31:34,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5d89e8029/1eaba02d680e45a1b9fbc2cf4e373230/FLAG2795ff68d [2021-01-06 13:31:35,295 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 13:31:35,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label28.c [2021-01-06 13:31:35,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5d89e8029/1eaba02d680e45a1b9fbc2cf4e373230/FLAG2795ff68d [2021-01-06 13:31:35,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5d89e8029/1eaba02d680e45a1b9fbc2cf4e373230 [2021-01-06 13:31:35,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 13:31:35,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 13:31:35,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 13:31:35,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 13:31:35,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 13:31:35,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:31:35" (1/1) ... [2021-01-06 13:31:35,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ee63e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:35, skipping insertion in model container [2021-01-06 13:31:35,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:31:35" (1/1) ... [2021-01-06 13:31:35,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 13:31:35,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 13:31:35,753 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/Problem10_label28.c[1526,1539] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 13:31:36,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:31:36,018 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 13:31:36,039 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/Problem10_label28.c[1526,1539] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 13:31:36,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:31:36,179 INFO L208 MainTranslator]: Completed translation [2021-01-06 13:31:36,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:36 WrapperNode [2021-01-06 13:31:36,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 13:31:36,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 13:31:36,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 13:31:36,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 13:31:36,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:36" (1/1) ... [2021-01-06 13:31:36,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:36" (1/1) ... [2021-01-06 13:31:36,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 13:31:36,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 13:31:36,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 13:31:36,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 13:31:36,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:36" (1/1) ... [2021-01-06 13:31:36,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:36" (1/1) ... [2021-01-06 13:31:36,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:36" (1/1) ... [2021-01-06 13:31:36,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:36" (1/1) ... [2021-01-06 13:31:36,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:36" (1/1) ... [2021-01-06 13:31:36,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:36" (1/1) ... [2021-01-06 13:31:36,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:36" (1/1) ... [2021-01-06 13:31:36,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 13:31:36,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 13:31:36,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 13:31:36,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 13:31:36,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:36" (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 13:31:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 13:31:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 13:31:36,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 13:31:36,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 13:31:38,195 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 13:31:38,197 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 13:31:38,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:31:38 BoogieIcfgContainer [2021-01-06 13:31:38,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 13:31:38,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 13:31:38,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 13:31:38,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 13:31:38,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 01:31:35" (1/3) ... [2021-01-06 13:31:38,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428777f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:31:38, skipping insertion in model container [2021-01-06 13:31:38,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:36" (2/3) ... [2021-01-06 13:31:38,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428777f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:31:38, skipping insertion in model container [2021-01-06 13:31:38,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:31:38" (3/3) ... [2021-01-06 13:31:38,217 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label28.c [2021-01-06 13:31:38,229 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 13:31:38,235 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 13:31:38,258 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 13:31:38,304 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 13:31:38,304 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 13:31:38,304 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 13:31:38,305 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 13:31:38,305 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 13:31:38,305 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 13:31:38,305 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 13:31:38,305 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 13:31:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2021-01-06 13:31:38,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 13:31:38,334 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:38,335 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:38,336 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:38,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:38,346 INFO L82 PathProgramCache]: Analyzing trace with hash -988188511, now seen corresponding path program 1 times [2021-01-06 13:31:38,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:38,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754270128] [2021-01-06 13:31:38,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:38,574 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 13:31:38,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754270128] [2021-01-06 13:31:38,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:38,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:31:38,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533893746] [2021-01-06 13:31:38,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:38,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:38,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:38,606 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2021-01-06 13:31:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:39,769 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2021-01-06 13:31:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:39,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-01-06 13:31:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:39,811 INFO L225 Difference]: With dead ends: 552 [2021-01-06 13:31:39,811 INFO L226 Difference]: Without dead ends: 282 [2021-01-06 13:31:39,826 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 13:31:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-01-06 13:31:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-01-06 13:31:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2021-01-06 13:31:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2021-01-06 13:31:39,912 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 11 [2021-01-06 13:31:39,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:39,914 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2021-01-06 13:31:39,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2021-01-06 13:31:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 13:31:39,919 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:39,920 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:39,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 13:31:39,920 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:39,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:39,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1081014105, now seen corresponding path program 1 times [2021-01-06 13:31:39,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:39,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894173423] [2021-01-06 13:31:39,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:40,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894173423] [2021-01-06 13:31:40,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:40,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:31:40,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774180459] [2021-01-06 13:31:40,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:40,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:40,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:40,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:40,276 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 3 states. [2021-01-06 13:31:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:41,047 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2021-01-06 13:31:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:41,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 13:31:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:41,053 INFO L225 Difference]: With dead ends: 701 [2021-01-06 13:31:41,053 INFO L226 Difference]: Without dead ends: 421 [2021-01-06 13:31:41,055 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 13:31:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-01-06 13:31:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2021-01-06 13:31:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2021-01-06 13:31:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2021-01-06 13:31:41,087 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 80 [2021-01-06 13:31:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:41,088 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2021-01-06 13:31:41,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2021-01-06 13:31:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 13:31:41,092 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:41,092 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:41,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 13:31:41,092 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:41,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:41,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1549752968, now seen corresponding path program 1 times [2021-01-06 13:31:41,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:41,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614680163] [2021-01-06 13:31:41,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:41,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614680163] [2021-01-06 13:31:41,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:41,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:31:41,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752525676] [2021-01-06 13:31:41,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:41,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:41,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:41,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:41,212 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2021-01-06 13:31:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:42,076 INFO L93 Difference]: Finished difference Result 562 states and 822 transitions. [2021-01-06 13:31:42,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:42,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-06 13:31:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:42,082 INFO L225 Difference]: With dead ends: 562 [2021-01-06 13:31:42,083 INFO L226 Difference]: Without dead ends: 560 [2021-01-06 13:31:42,083 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 13:31:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-01-06 13:31:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2021-01-06 13:31:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2021-01-06 13:31:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2021-01-06 13:31:42,107 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 86 [2021-01-06 13:31:42,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:42,107 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2021-01-06 13:31:42,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:42,108 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2021-01-06 13:31:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 13:31:42,112 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:42,112 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:42,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 13:31:42,113 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:42,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:42,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1254754554, now seen corresponding path program 1 times [2021-01-06 13:31:42,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:42,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280393602] [2021-01-06 13:31:42,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:42,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280393602] [2021-01-06 13:31:42,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:42,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:31:42,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205690647] [2021-01-06 13:31:42,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:31:42,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:42,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:31:42,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:31:42,414 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 4 states. [2021-01-06 13:31:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:43,283 INFO L93 Difference]: Finished difference Result 848 states and 1218 transitions. [2021-01-06 13:31:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 13:31:43,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-06 13:31:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:43,287 INFO L225 Difference]: With dead ends: 848 [2021-01-06 13:31:43,287 INFO L226 Difference]: Without dead ends: 429 [2021-01-06 13:31:43,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 13:31:43,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-01-06 13:31:43,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 421. [2021-01-06 13:31:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2021-01-06 13:31:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 576 transitions. [2021-01-06 13:31:43,305 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 576 transitions. Word has length 105 [2021-01-06 13:31:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:43,306 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 576 transitions. [2021-01-06 13:31:43,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:31:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 576 transitions. [2021-01-06 13:31:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 13:31:43,316 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:43,317 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:43,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 13:31:43,319 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:43,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:43,320 INFO L82 PathProgramCache]: Analyzing trace with hash -623288027, now seen corresponding path program 1 times [2021-01-06 13:31:43,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:43,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354709899] [2021-01-06 13:31:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:43,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354709899] [2021-01-06 13:31:43,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:43,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:31:43,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754871066] [2021-01-06 13:31:43,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:43,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:43,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:43,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:43,566 INFO L87 Difference]: Start difference. First operand 421 states and 576 transitions. Second operand 3 states. [2021-01-06 13:31:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:44,292 INFO L93 Difference]: Finished difference Result 979 states and 1435 transitions. [2021-01-06 13:31:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:44,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2021-01-06 13:31:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:44,298 INFO L225 Difference]: With dead ends: 979 [2021-01-06 13:31:44,298 INFO L226 Difference]: Without dead ends: 699 [2021-01-06 13:31:44,299 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 13:31:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-01-06 13:31:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2021-01-06 13:31:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-01-06 13:31:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 875 transitions. [2021-01-06 13:31:44,319 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 875 transitions. Word has length 155 [2021-01-06 13:31:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:44,319 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 875 transitions. [2021-01-06 13:31:44,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 875 transitions. [2021-01-06 13:31:44,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-01-06 13:31:44,323 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:44,323 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:44,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 13:31:44,324 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:44,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:44,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1357757561, now seen corresponding path program 1 times [2021-01-06 13:31:44,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:44,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022746100] [2021-01-06 13:31:44,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:44,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022746100] [2021-01-06 13:31:44,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:44,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 13:31:44,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452664718] [2021-01-06 13:31:44,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 13:31:44,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:44,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 13:31:44,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:31:44,630 INFO L87 Difference]: Start difference. First operand 699 states and 875 transitions. Second operand 7 states. [2021-01-06 13:31:45,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:45,481 INFO L93 Difference]: Finished difference Result 1312 states and 1659 transitions. [2021-01-06 13:31:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 13:31:45,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2021-01-06 13:31:45,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:45,486 INFO L225 Difference]: With dead ends: 1312 [2021-01-06 13:31:45,486 INFO L226 Difference]: Without dead ends: 699 [2021-01-06 13:31:45,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:31:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-01-06 13:31:45,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2021-01-06 13:31:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-01-06 13:31:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 872 transitions. [2021-01-06 13:31:45,507 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 872 transitions. Word has length 164 [2021-01-06 13:31:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:45,508 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 872 transitions. [2021-01-06 13:31:45,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 13:31:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 872 transitions. [2021-01-06 13:31:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-01-06 13:31:45,511 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:45,512 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 13:31:45,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 13:31:45,512 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:45,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:45,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2017622509, now seen corresponding path program 1 times [2021-01-06 13:31:45,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:45,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305214970] [2021-01-06 13:31:45,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:45,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305214970] [2021-01-06 13:31:45,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:45,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:31:45,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419890851] [2021-01-06 13:31:45,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:45,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:45,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:45,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:45,680 INFO L87 Difference]: Start difference. First operand 699 states and 872 transitions. Second operand 3 states. [2021-01-06 13:31:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:46,372 INFO L93 Difference]: Finished difference Result 1535 states and 2026 transitions. [2021-01-06 13:31:46,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:46,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2021-01-06 13:31:46,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:46,379 INFO L225 Difference]: With dead ends: 1535 [2021-01-06 13:31:46,379 INFO L226 Difference]: Without dead ends: 977 [2021-01-06 13:31:46,380 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 13:31:46,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-01-06 13:31:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2021-01-06 13:31:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2021-01-06 13:31:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1046 transitions. [2021-01-06 13:31:46,403 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1046 transitions. Word has length 200 [2021-01-06 13:31:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:46,404 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1046 transitions. [2021-01-06 13:31:46,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1046 transitions. [2021-01-06 13:31:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2021-01-06 13:31:46,408 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:46,408 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:46,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 13:31:46,409 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:46,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:46,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1219323411, now seen corresponding path program 1 times [2021-01-06 13:31:46,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:46,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277942194] [2021-01-06 13:31:46,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-01-06 13:31:46,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277942194] [2021-01-06 13:31:46,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:46,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:31:46,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529141234] [2021-01-06 13:31:46,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:46,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:46,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:46,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:46,643 INFO L87 Difference]: Start difference. First operand 838 states and 1046 transitions. Second operand 3 states. [2021-01-06 13:31:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:47,338 INFO L93 Difference]: Finished difference Result 1813 states and 2374 transitions. [2021-01-06 13:31:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:47,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2021-01-06 13:31:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:47,345 INFO L225 Difference]: With dead ends: 1813 [2021-01-06 13:31:47,345 INFO L226 Difference]: Without dead ends: 1116 [2021-01-06 13:31:47,347 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 13:31:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2021-01-06 13:31:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 977. [2021-01-06 13:31:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2021-01-06 13:31:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1204 transitions. [2021-01-06 13:31:47,373 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1204 transitions. Word has length 235 [2021-01-06 13:31:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:47,373 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 1204 transitions. [2021-01-06 13:31:47,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1204 transitions. [2021-01-06 13:31:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-01-06 13:31:47,377 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:47,378 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:47,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 13:31:47,378 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1025371890, now seen corresponding path program 1 times [2021-01-06 13:31:47,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:47,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043922889] [2021-01-06 13:31:47,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 32 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:47,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043922889] [2021-01-06 13:31:47,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069899585] [2021-01-06 13:31:47,943 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 13:31:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:48,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 13:31:48,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:31:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-01-06 13:31:48,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:31:48,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2021-01-06 13:31:48,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680617249] [2021-01-06 13:31:48,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:48,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:48,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:48,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:31:48,610 INFO L87 Difference]: Start difference. First operand 977 states and 1204 transitions. Second operand 3 states. [2021-01-06 13:31:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:49,319 INFO L93 Difference]: Finished difference Result 2091 states and 2595 transitions. [2021-01-06 13:31:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:49,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2021-01-06 13:31:49,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:49,327 INFO L225 Difference]: With dead ends: 2091 [2021-01-06 13:31:49,327 INFO L226 Difference]: Without dead ends: 1255 [2021-01-06 13:31:49,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:31:49,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2021-01-06 13:31:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2021-01-06 13:31:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2021-01-06 13:31:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1456 transitions. [2021-01-06 13:31:49,360 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1456 transitions. Word has length 238 [2021-01-06 13:31:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:49,360 INFO L481 AbstractCegarLoop]: Abstraction has 1255 states and 1456 transitions. [2021-01-06 13:31:49,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1456 transitions. [2021-01-06 13:31:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2021-01-06 13:31:49,365 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:49,366 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:49,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-06 13:31:49,580 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:49,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:49,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1432200997, now seen corresponding path program 1 times [2021-01-06 13:31:49,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:49,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989543002] [2021-01-06 13:31:49,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2021-01-06 13:31:49,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989543002] [2021-01-06 13:31:49,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:49,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:31:49,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659341635] [2021-01-06 13:31:49,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:49,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:49,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:49,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:49,787 INFO L87 Difference]: Start difference. First operand 1255 states and 1456 transitions. Second operand 3 states. [2021-01-06 13:31:50,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:50,513 INFO L93 Difference]: Finished difference Result 3203 states and 3730 transitions. [2021-01-06 13:31:50,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:50,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2021-01-06 13:31:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:50,525 INFO L225 Difference]: With dead ends: 3203 [2021-01-06 13:31:50,525 INFO L226 Difference]: Without dead ends: 2089 [2021-01-06 13:31:50,527 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 13:31:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2021-01-06 13:31:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1672. [2021-01-06 13:31:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2021-01-06 13:31:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1952 transitions. [2021-01-06 13:31:50,576 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1952 transitions. Word has length 289 [2021-01-06 13:31:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:50,576 INFO L481 AbstractCegarLoop]: Abstraction has 1672 states and 1952 transitions. [2021-01-06 13:31:50,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1952 transitions. [2021-01-06 13:31:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2021-01-06 13:31:50,583 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:50,583 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:50,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 13:31:50,584 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:50,585 INFO L82 PathProgramCache]: Analyzing trace with hash -490183734, now seen corresponding path program 1 times [2021-01-06 13:31:50,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:50,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743674530] [2021-01-06 13:31:50,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-01-06 13:31:50,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743674530] [2021-01-06 13:31:50,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:50,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:31:50,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066772884] [2021-01-06 13:31:50,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:50,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:50,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:50,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:50,847 INFO L87 Difference]: Start difference. First operand 1672 states and 1952 transitions. Second operand 3 states. [2021-01-06 13:31:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:51,579 INFO L93 Difference]: Finished difference Result 3898 states and 4557 transitions. [2021-01-06 13:31:51,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:51,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2021-01-06 13:31:51,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:51,593 INFO L225 Difference]: With dead ends: 3898 [2021-01-06 13:31:51,593 INFO L226 Difference]: Without dead ends: 2367 [2021-01-06 13:31:51,597 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 13:31:51,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2021-01-06 13:31:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2367. [2021-01-06 13:31:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2021-01-06 13:31:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2712 transitions. [2021-01-06 13:31:51,666 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2712 transitions. Word has length 306 [2021-01-06 13:31:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:51,667 INFO L481 AbstractCegarLoop]: Abstraction has 2367 states and 2712 transitions. [2021-01-06 13:31:51,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2712 transitions. [2021-01-06 13:31:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2021-01-06 13:31:51,674 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:51,675 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:51,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 13:31:51,675 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:51,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:51,676 INFO L82 PathProgramCache]: Analyzing trace with hash -230704853, now seen corresponding path program 1 times [2021-01-06 13:31:51,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:51,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086480596] [2021-01-06 13:31:51,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2021-01-06 13:31:51,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086480596] [2021-01-06 13:31:51,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:51,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:31:51,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169977813] [2021-01-06 13:31:51,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:51,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:51,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:51,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:51,899 INFO L87 Difference]: Start difference. First operand 2367 states and 2712 transitions. Second operand 3 states. [2021-01-06 13:31:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:52,554 INFO L93 Difference]: Finished difference Result 4732 states and 5427 transitions. [2021-01-06 13:31:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:52,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2021-01-06 13:31:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:52,567 INFO L225 Difference]: With dead ends: 4732 [2021-01-06 13:31:52,568 INFO L226 Difference]: Without dead ends: 2228 [2021-01-06 13:31:52,572 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 13:31:52,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2021-01-06 13:31:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2228. [2021-01-06 13:31:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2021-01-06 13:31:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2517 transitions. [2021-01-06 13:31:52,632 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2517 transitions. Word has length 310 [2021-01-06 13:31:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:52,633 INFO L481 AbstractCegarLoop]: Abstraction has 2228 states and 2517 transitions. [2021-01-06 13:31:52,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2517 transitions. [2021-01-06 13:31:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2021-01-06 13:31:52,641 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:52,641 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:52,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 13:31:52,642 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:52,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2098557402, now seen corresponding path program 1 times [2021-01-06 13:31:52,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:52,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796421027] [2021-01-06 13:31:52,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 13:31:52,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 13:31:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 13:31:52,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 13:31:52,972 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 13:31:52,972 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 13:31:52,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 13:31:53,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 01:31:53 BoogieIcfgContainer [2021-01-06 13:31:53,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 13:31:53,211 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 13:31:53,211 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 13:31:53,211 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 13:31:53,212 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:31:38" (3/4) ... [2021-01-06 13:31:53,214 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 13:31:53,440 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem10_label28.c-witness.graphml [2021-01-06 13:31:53,444 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 13:31:53,446 INFO L168 Benchmark]: Toolchain (without parser) took 17953.75 ms. Allocated memory was 151.0 MB in the beginning and 351.3 MB in the end (delta: 200.3 MB). Free memory was 124.6 MB in the beginning and 223.8 MB in the end (delta: -99.1 MB). Peak memory consumption was 102.2 MB. Max. memory is 8.0 GB. [2021-01-06 13:31:53,447 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.6 MB in the end (delta: 80.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 13:31:53,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.12 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 127.5 MB in the end (delta: -3.1 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. [2021-01-06 13:31:53,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.88 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 119.6 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-01-06 13:31:53,448 INFO L168 Benchmark]: Boogie Preprocessor took 87.00 ms. Allocated memory is still 151.0 MB. Free memory was 119.6 MB in the beginning and 114.3 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-01-06 13:31:53,448 INFO L168 Benchmark]: RCFGBuilder took 1828.45 ms. Allocated memory is still 151.0 MB. Free memory was 114.3 MB in the beginning and 90.2 MB in the end (delta: 24.1 MB). Peak memory consumption was 74.5 MB. Max. memory is 8.0 GB. [2021-01-06 13:31:53,449 INFO L168 Benchmark]: TraceAbstraction took 15006.64 ms. Allocated memory was 151.0 MB in the beginning and 351.3 MB in the end (delta: 200.3 MB). Free memory was 89.7 MB in the beginning and 262.2 MB in the end (delta: -172.6 MB). Peak memory consumption was 178.2 MB. Max. memory is 8.0 GB. [2021-01-06 13:31:53,449 INFO L168 Benchmark]: Witness Printer took 233.25 ms. Allocated memory is still 351.3 MB. Free memory was 262.2 MB in the beginning and 223.8 MB in the end (delta: 38.5 MB). Peak memory consumption was 38.8 MB. Max. memory is 8.0 GB. [2021-01-06 13:31:53,452 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.22 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.6 MB in the end (delta: 80.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 686.12 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 127.5 MB in the end (delta: -3.1 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 103.88 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 119.6 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 87.00 ms. Allocated memory is still 151.0 MB. Free memory was 119.6 MB in the beginning and 114.3 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1828.45 ms. Allocated memory is still 151.0 MB. Free memory was 114.3 MB in the beginning and 90.2 MB in the end (delta: 24.1 MB). Peak memory consumption was 74.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15006.64 ms. Allocated memory was 151.0 MB in the beginning and 351.3 MB in the end (delta: 200.3 MB). Free memory was 89.7 MB in the beginning and 262.2 MB in the end (delta: -172.6 MB). Peak memory consumption was 178.2 MB. Max. memory is 8.0 GB. * Witness Printer took 233.25 ms. Allocated memory is still 351.3 MB. Free memory was 262.2 MB in the beginning and 223.8 MB in the end (delta: 38.5 MB). Peak memory consumption was 38.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 47]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L436] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L437] a10 = 1 [L439] return 25; VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L297] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L298] a19 = 10 [L300] return 25; VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND TRUE (((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)) [L465] a1 = ((((a1 + 381077) % 25)- -1) / 5) [L466] a10 = 2 [L467] a19 = 7 [L469] return -1; VAL [a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] reach_error() VAL [a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.6s, OverallIterations: 13, TraceHistogramMax: 4, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1324 SDtfs, 1227 SDslu, 72 SDs, 0 SdLazy, 4892 SolverSat, 791 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2367occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 842 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2736 NumberOfCodeBlocks, 2736 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2404 ConstructedInterpolants, 0 QuantifiedInterpolants, 1744821 SizeOfPredicates, 0 NumberOfNonLiveVariables, 360 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1376/1471 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...