/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-dcfa08f [2020-12-23 03:37:20,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 03:37:20,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 03:37:20,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 03:37:20,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 03:37:20,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 03:37:20,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 03:37:20,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 03:37:20,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 03:37:20,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 03:37:20,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 03:37:20,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 03:37:20,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 03:37:20,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 03:37:20,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 03:37:20,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 03:37:20,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 03:37:20,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 03:37:20,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 03:37:20,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 03:37:20,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 03:37:20,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 03:37:20,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 03:37:20,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 03:37:20,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 03:37:20,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 03:37:20,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 03:37:20,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 03:37:20,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 03:37:20,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 03:37:20,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 03:37:20,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 03:37:20,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 03:37:20,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 03:37:20,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 03:37:20,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 03:37:20,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 03:37:20,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 03:37:20,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 03:37:20,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 03:37:20,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 03:37:20,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 03:37:20,252 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 03:37:20,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 03:37:20,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 03:37:20,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 03:37:20,254 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 03:37:20,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 03:37:20,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 03:37:20,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 03:37:20,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 03:37:20,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 03:37:20,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 03:37:20,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 03:37:20,256 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 03:37:20,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 03:37:20,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 03:37:20,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 03:37:20,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 03:37:20,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 03:37:20,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 03:37:20,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 03:37:20,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 03:37:20,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 03:37:20,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 03:37:20,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 03:37:20,259 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 03:37:20,259 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 [2020-12-23 03:37:20,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 03:37:20,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 03:37:20,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 03:37:20,796 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 03:37:20,796 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 03:37:20,797 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 [2020-12-23 03:37:20,893 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2db32e7c0/94ef1c7fca3c45f09333800338f61458/FLAGad959ddee [2020-12-23 03:37:21,705 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 03:37:21,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label28.c [2020-12-23 03:37:21,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2db32e7c0/94ef1c7fca3c45f09333800338f61458/FLAGad959ddee [2020-12-23 03:37:21,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2db32e7c0/94ef1c7fca3c45f09333800338f61458 [2020-12-23 03:37:21,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 03:37:21,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 03:37:21,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 03:37:21,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 03:37:21,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 03:37:21,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:37:21" (1/1) ... [2020-12-23 03:37:21,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7d0073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:21, skipping insertion in model container [2020-12-23 03:37:21,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:37:21" (1/1) ... [2020-12-23 03:37:21,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 03:37:22,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 03:37:22,230 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/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,] [2020-12-23 03:37:22,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 03:37:22,505 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 03:37:22,543 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,] [2020-12-23 03:37:22,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 03:37:22,694 INFO L208 MainTranslator]: Completed translation [2020-12-23 03:37:22,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:22 WrapperNode [2020-12-23 03:37:22,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 03:37:22,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 03:37:22,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 03:37:22,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 03:37:22,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:22" (1/1) ... [2020-12-23 03:37:22,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:22" (1/1) ... [2020-12-23 03:37:22,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 03:37:22,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 03:37:22,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 03:37:22,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 03:37:22,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:22" (1/1) ... [2020-12-23 03:37:22,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:22" (1/1) ... [2020-12-23 03:37:22,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:22" (1/1) ... [2020-12-23 03:37:22,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:22" (1/1) ... [2020-12-23 03:37:22,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:22" (1/1) ... [2020-12-23 03:37:22,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:22" (1/1) ... [2020-12-23 03:37:23,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:22" (1/1) ... [2020-12-23 03:37:23,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 03:37:23,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 03:37:23,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 03:37:23,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 03:37:23,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:22" (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 [2020-12-23 03:37:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 03:37:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 03:37:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 03:37:23,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 03:37:25,007 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 03:37:25,008 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 03:37:25,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:37:25 BoogieIcfgContainer [2020-12-23 03:37:25,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 03:37:25,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 03:37:25,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 03:37:25,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 03:37:25,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:37:21" (1/3) ... [2020-12-23 03:37:25,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@811e2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:37:25, skipping insertion in model container [2020-12-23 03:37:25,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:22" (2/3) ... [2020-12-23 03:37:25,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@811e2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:37:25, skipping insertion in model container [2020-12-23 03:37:25,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:37:25" (3/3) ... [2020-12-23 03:37:25,029 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label28.c [2020-12-23 03:37:25,038 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 03:37:25,045 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 03:37:25,069 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 03:37:25,102 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 03:37:25,103 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 03:37:25,103 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 03:37:25,103 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 03:37:25,103 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 03:37:25,103 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 03:37:25,104 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 03:37:25,104 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 03:37:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2020-12-23 03:37:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 03:37:25,135 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:25,136 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:37:25,137 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:25,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:25,144 INFO L82 PathProgramCache]: Analyzing trace with hash -988188511, now seen corresponding path program 1 times [2020-12-23 03:37:25,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:25,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141145217] [2020-12-23 03:37:25,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:37:25,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141145217] [2020-12-23 03:37:25,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:25,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:37:25,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361802732] [2020-12-23 03:37:25,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:37:25,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:25,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:37:25,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:25,406 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2020-12-23 03:37:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:26,439 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2020-12-23 03:37:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:37:26,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-23 03:37:26,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:26,458 INFO L225 Difference]: With dead ends: 552 [2020-12-23 03:37:26,458 INFO L226 Difference]: Without dead ends: 282 [2020-12-23 03:37:26,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-23 03:37:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-12-23 03:37:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 03:37:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2020-12-23 03:37:26,531 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 11 [2020-12-23 03:37:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:26,532 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2020-12-23 03:37:26,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:37:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2020-12-23 03:37:26,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 03:37:26,535 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:26,536 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] [2020-12-23 03:37:26,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 03:37:26,537 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:26,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1081014105, now seen corresponding path program 1 times [2020-12-23 03:37:26,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:26,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323670674] [2020-12-23 03:37:26,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:37:26,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323670674] [2020-12-23 03:37:26,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:26,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:37:26,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046208584] [2020-12-23 03:37:26,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:37:26,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:26,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:37:26,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:26,889 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 3 states. [2020-12-23 03:37:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:27,571 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2020-12-23 03:37:27,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:37:27,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-23 03:37:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:27,576 INFO L225 Difference]: With dead ends: 701 [2020-12-23 03:37:27,576 INFO L226 Difference]: Without dead ends: 421 [2020-12-23 03:37:27,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-12-23 03:37:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-12-23 03:37:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-12-23 03:37:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2020-12-23 03:37:27,614 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 80 [2020-12-23 03:37:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:27,615 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2020-12-23 03:37:27,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:37:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2020-12-23 03:37:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 03:37:27,619 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:27,619 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] [2020-12-23 03:37:27,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 03:37:27,619 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:27,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:27,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1549752968, now seen corresponding path program 1 times [2020-12-23 03:37:27,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:27,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274222636] [2020-12-23 03:37:27,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:37:27,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274222636] [2020-12-23 03:37:27,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:27,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:37:27,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606463488] [2020-12-23 03:37:27,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:37:27,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:27,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:37:27,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:27,787 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2020-12-23 03:37:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:28,514 INFO L93 Difference]: Finished difference Result 562 states and 822 transitions. [2020-12-23 03:37:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:37:28,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-23 03:37:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:28,519 INFO L225 Difference]: With dead ends: 562 [2020-12-23 03:37:28,519 INFO L226 Difference]: Without dead ends: 560 [2020-12-23 03:37:28,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-12-23 03:37:28,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2020-12-23 03:37:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-12-23 03:37:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2020-12-23 03:37:28,566 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 86 [2020-12-23 03:37:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:28,567 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2020-12-23 03:37:28,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:37:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2020-12-23 03:37:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 03:37:28,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:28,572 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] [2020-12-23 03:37:28,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 03:37:28,573 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:28,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:28,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1254754554, now seen corresponding path program 1 times [2020-12-23 03:37:28,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:28,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653831866] [2020-12-23 03:37:28,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:37:28,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653831866] [2020-12-23 03:37:28,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:28,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:37:28,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266021207] [2020-12-23 03:37:28,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:37:28,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:28,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:37:28,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:37:28,869 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 4 states. [2020-12-23 03:37:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:29,705 INFO L93 Difference]: Finished difference Result 848 states and 1218 transitions. [2020-12-23 03:37:29,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 03:37:29,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2020-12-23 03:37:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:29,710 INFO L225 Difference]: With dead ends: 848 [2020-12-23 03:37:29,710 INFO L226 Difference]: Without dead ends: 429 [2020-12-23 03:37:29,712 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 [2020-12-23 03:37:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-12-23 03:37:29,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 421. [2020-12-23 03:37:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-12-23 03:37:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 576 transitions. [2020-12-23 03:37:29,726 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 576 transitions. Word has length 105 [2020-12-23 03:37:29,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:29,729 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 576 transitions. [2020-12-23 03:37:29,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:37:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 576 transitions. [2020-12-23 03:37:29,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-12-23 03:37:29,737 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:29,738 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] [2020-12-23 03:37:29,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 03:37:29,738 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:29,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:29,739 INFO L82 PathProgramCache]: Analyzing trace with hash -623288027, now seen corresponding path program 1 times [2020-12-23 03:37:29,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:29,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79448992] [2020-12-23 03:37:29,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:37:29,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79448992] [2020-12-23 03:37:29,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:29,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:37:29,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413050455] [2020-12-23 03:37:29,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:37:29,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:29,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:37:29,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:29,994 INFO L87 Difference]: Start difference. First operand 421 states and 576 transitions. Second operand 3 states. [2020-12-23 03:37:30,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:30,644 INFO L93 Difference]: Finished difference Result 979 states and 1435 transitions. [2020-12-23 03:37:30,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:37:30,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2020-12-23 03:37:30,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:30,651 INFO L225 Difference]: With dead ends: 979 [2020-12-23 03:37:30,651 INFO L226 Difference]: Without dead ends: 699 [2020-12-23 03:37:30,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-12-23 03:37:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2020-12-23 03:37:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2020-12-23 03:37:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 875 transitions. [2020-12-23 03:37:30,673 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 875 transitions. Word has length 155 [2020-12-23 03:37:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:30,673 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 875 transitions. [2020-12-23 03:37:30,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:37:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 875 transitions. [2020-12-23 03:37:30,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-23 03:37:30,677 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:30,678 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] [2020-12-23 03:37:30,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 03:37:30,678 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:30,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:30,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1357757561, now seen corresponding path program 1 times [2020-12-23 03:37:30,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:30,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210521084] [2020-12-23 03:37:30,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:37:30,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210521084] [2020-12-23 03:37:30,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:30,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 03:37:30,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415464651] [2020-12-23 03:37:30,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 03:37:30,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:30,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 03:37:30,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 03:37:30,958 INFO L87 Difference]: Start difference. First operand 699 states and 875 transitions. Second operand 7 states. [2020-12-23 03:37:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:31,667 INFO L93 Difference]: Finished difference Result 1312 states and 1659 transitions. [2020-12-23 03:37:31,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 03:37:31,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2020-12-23 03:37:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:31,672 INFO L225 Difference]: With dead ends: 1312 [2020-12-23 03:37:31,672 INFO L226 Difference]: Without dead ends: 699 [2020-12-23 03:37:31,673 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 [2020-12-23 03:37:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-12-23 03:37:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2020-12-23 03:37:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2020-12-23 03:37:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 872 transitions. [2020-12-23 03:37:31,693 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 872 transitions. Word has length 164 [2020-12-23 03:37:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:31,693 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 872 transitions. [2020-12-23 03:37:31,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 03:37:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 872 transitions. [2020-12-23 03:37:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-12-23 03:37:31,696 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:31,697 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] [2020-12-23 03:37:31,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 03:37:31,697 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:31,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2017622509, now seen corresponding path program 1 times [2020-12-23 03:37:31,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:31,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135591518] [2020-12-23 03:37:31,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:37:31,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135591518] [2020-12-23 03:37:31,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:31,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:37:31,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807308254] [2020-12-23 03:37:31,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:37:31,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:31,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:37:31,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:31,871 INFO L87 Difference]: Start difference. First operand 699 states and 872 transitions. Second operand 3 states. [2020-12-23 03:37:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:32,514 INFO L93 Difference]: Finished difference Result 1535 states and 2026 transitions. [2020-12-23 03:37:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:37:32,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2020-12-23 03:37:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:32,520 INFO L225 Difference]: With dead ends: 1535 [2020-12-23 03:37:32,520 INFO L226 Difference]: Without dead ends: 977 [2020-12-23 03:37:32,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:32,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2020-12-23 03:37:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2020-12-23 03:37:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-12-23 03:37:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1046 transitions. [2020-12-23 03:37:32,547 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1046 transitions. Word has length 200 [2020-12-23 03:37:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:32,548 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1046 transitions. [2020-12-23 03:37:32,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:37:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1046 transitions. [2020-12-23 03:37:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-12-23 03:37:32,552 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:32,552 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] [2020-12-23 03:37:32,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 03:37:32,553 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:32,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:32,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1219323411, now seen corresponding path program 1 times [2020-12-23 03:37:32,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:32,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097263526] [2020-12-23 03:37:32,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-23 03:37:32,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097263526] [2020-12-23 03:37:32,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:32,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:37:32,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383466881] [2020-12-23 03:37:32,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:37:32,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:32,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:37:32,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:32,754 INFO L87 Difference]: Start difference. First operand 838 states and 1046 transitions. Second operand 3 states. [2020-12-23 03:37:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:33,349 INFO L93 Difference]: Finished difference Result 1813 states and 2374 transitions. [2020-12-23 03:37:33,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:37:33,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2020-12-23 03:37:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:33,357 INFO L225 Difference]: With dead ends: 1813 [2020-12-23 03:37:33,357 INFO L226 Difference]: Without dead ends: 1116 [2020-12-23 03:37:33,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:33,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2020-12-23 03:37:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 977. [2020-12-23 03:37:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2020-12-23 03:37:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1204 transitions. [2020-12-23 03:37:33,387 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1204 transitions. Word has length 235 [2020-12-23 03:37:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:33,388 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 1204 transitions. [2020-12-23 03:37:33,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:37:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1204 transitions. [2020-12-23 03:37:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-23 03:37:33,392 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:33,392 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] [2020-12-23 03:37:33,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 03:37:33,393 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:33,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1025371890, now seen corresponding path program 1 times [2020-12-23 03:37:33,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:33,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509025853] [2020-12-23 03:37:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 32 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:37:33,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509025853] [2020-12-23 03:37:33,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077640438] [2020-12-23 03:37:33,809 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 [2020-12-23 03:37:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:33,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 03:37:33,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:37:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-12-23 03:37:34,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 03:37:34,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2020-12-23 03:37:34,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478880916] [2020-12-23 03:37:34,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:37:34,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:34,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:37:34,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 03:37:34,518 INFO L87 Difference]: Start difference. First operand 977 states and 1204 transitions. Second operand 3 states. [2020-12-23 03:37:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:35,086 INFO L93 Difference]: Finished difference Result 2091 states and 2595 transitions. [2020-12-23 03:37:35,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:37:35,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2020-12-23 03:37:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:35,094 INFO L225 Difference]: With dead ends: 2091 [2020-12-23 03:37:35,095 INFO L226 Difference]: Without dead ends: 1255 [2020-12-23 03:37:35,097 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 [2020-12-23 03:37:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2020-12-23 03:37:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2020-12-23 03:37:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2020-12-23 03:37:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1456 transitions. [2020-12-23 03:37:35,159 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1456 transitions. Word has length 238 [2020-12-23 03:37:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:35,159 INFO L481 AbstractCegarLoop]: Abstraction has 1255 states and 1456 transitions. [2020-12-23 03:37:35,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:37:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1456 transitions. [2020-12-23 03:37:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2020-12-23 03:37:35,166 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:35,166 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] [2020-12-23 03:37:35,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-12-23 03:37:35,382 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:35,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:35,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1432200997, now seen corresponding path program 1 times [2020-12-23 03:37:35,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:35,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118478507] [2020-12-23 03:37:35,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-12-23 03:37:35,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118478507] [2020-12-23 03:37:35,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:35,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:37:35,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330462566] [2020-12-23 03:37:35,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:37:35,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:35,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:37:35,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:35,617 INFO L87 Difference]: Start difference. First operand 1255 states and 1456 transitions. Second operand 3 states. [2020-12-23 03:37:36,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:36,313 INFO L93 Difference]: Finished difference Result 3203 states and 3730 transitions. [2020-12-23 03:37:36,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:37:36,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2020-12-23 03:37:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:36,326 INFO L225 Difference]: With dead ends: 3203 [2020-12-23 03:37:36,326 INFO L226 Difference]: Without dead ends: 2089 [2020-12-23 03:37:36,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2020-12-23 03:37:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1672. [2020-12-23 03:37:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2020-12-23 03:37:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1952 transitions. [2020-12-23 03:37:36,378 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1952 transitions. Word has length 289 [2020-12-23 03:37:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:36,379 INFO L481 AbstractCegarLoop]: Abstraction has 1672 states and 1952 transitions. [2020-12-23 03:37:36,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:37:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1952 transitions. [2020-12-23 03:37:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2020-12-23 03:37:36,386 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:36,386 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] [2020-12-23 03:37:36,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 03:37:36,386 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:36,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:36,387 INFO L82 PathProgramCache]: Analyzing trace with hash -490183734, now seen corresponding path program 1 times [2020-12-23 03:37:36,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:36,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402181009] [2020-12-23 03:37:36,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-12-23 03:37:36,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402181009] [2020-12-23 03:37:36,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:36,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:37:36,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481593362] [2020-12-23 03:37:36,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:37:36,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:36,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:37:36,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:36,620 INFO L87 Difference]: Start difference. First operand 1672 states and 1952 transitions. Second operand 3 states. [2020-12-23 03:37:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:37,240 INFO L93 Difference]: Finished difference Result 3898 states and 4557 transitions. [2020-12-23 03:37:37,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:37:37,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2020-12-23 03:37:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:37,253 INFO L225 Difference]: With dead ends: 3898 [2020-12-23 03:37:37,253 INFO L226 Difference]: Without dead ends: 2367 [2020-12-23 03:37:37,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2020-12-23 03:37:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2367. [2020-12-23 03:37:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2020-12-23 03:37:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2712 transitions. [2020-12-23 03:37:37,319 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2712 transitions. Word has length 306 [2020-12-23 03:37:37,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:37,320 INFO L481 AbstractCegarLoop]: Abstraction has 2367 states and 2712 transitions. [2020-12-23 03:37:37,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:37:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2712 transitions. [2020-12-23 03:37:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2020-12-23 03:37:37,327 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:37,328 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] [2020-12-23 03:37:37,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 03:37:37,328 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash -230704853, now seen corresponding path program 1 times [2020-12-23 03:37:37,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:37,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791298278] [2020-12-23 03:37:37,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2020-12-23 03:37:37,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791298278] [2020-12-23 03:37:37,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:37,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:37:37,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884936250] [2020-12-23 03:37:37,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:37:37,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:37,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:37:37,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:37,588 INFO L87 Difference]: Start difference. First operand 2367 states and 2712 transitions. Second operand 3 states. [2020-12-23 03:37:38,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:38,284 INFO L93 Difference]: Finished difference Result 4732 states and 5427 transitions. [2020-12-23 03:37:38,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:37:38,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2020-12-23 03:37:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:38,298 INFO L225 Difference]: With dead ends: 4732 [2020-12-23 03:37:38,299 INFO L226 Difference]: Without dead ends: 2228 [2020-12-23 03:37:38,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:38,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2020-12-23 03:37:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2228. [2020-12-23 03:37:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2020-12-23 03:37:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2517 transitions. [2020-12-23 03:37:38,369 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2517 transitions. Word has length 310 [2020-12-23 03:37:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:38,370 INFO L481 AbstractCegarLoop]: Abstraction has 2228 states and 2517 transitions. [2020-12-23 03:37:38,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:37:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2517 transitions. [2020-12-23 03:37:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2020-12-23 03:37:38,378 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:38,378 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] [2020-12-23 03:37:38,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 03:37:38,379 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:38,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:38,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2098557402, now seen corresponding path program 1 times [2020-12-23 03:37:38,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:38,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032479001] [2020-12-23 03:37:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 03:37:38,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 03:37:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 03:37:38,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 03:37:38,751 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 03:37:38,751 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 03:37:38,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 03:37:38,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 03:37:38 BoogieIcfgContainer [2020-12-23 03:37:38,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 03:37:38,991 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 03:37:38,991 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 03:37:38,991 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 03:37:38,992 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:37:25" (3/4) ... [2020-12-23 03:37:38,994 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 03:37:39,269 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem10_label28.c-witness.graphml [2020-12-23 03:37:39,270 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 03:37:39,272 INFO L168 Benchmark]: Toolchain (without parser) took 17326.78 ms. Allocated memory was 161.5 MB in the beginning and 487.6 MB in the end (delta: 326.1 MB). Free memory was 135.8 MB in the beginning and 409.6 MB in the end (delta: -273.8 MB). Peak memory consumption was 52.7 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:39,273 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 161.5 MB. Free memory is still 134.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 03:37:39,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.35 ms. Allocated memory is still 161.5 MB. Free memory was 135.6 MB in the beginning and 108.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:39,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.32 ms. Allocated memory is still 161.5 MB. Free memory was 108.7 MB in the beginning and 100.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:39,274 INFO L168 Benchmark]: Boogie Preprocessor took 191.67 ms. Allocated memory is still 161.5 MB. Free memory was 100.8 MB in the beginning and 138.4 MB in the end (delta: -37.6 MB). Peak memory consumption was 12.0 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:39,275 INFO L168 Benchmark]: RCFGBuilder took 1977.11 ms. Allocated memory was 161.5 MB in the beginning and 204.5 MB in the end (delta: 43.0 MB). Free memory was 138.4 MB in the beginning and 164.6 MB in the end (delta: -26.3 MB). Peak memory consumption was 90.6 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:39,275 INFO L168 Benchmark]: TraceAbstraction took 13974.12 ms. Allocated memory was 204.5 MB in the beginning and 487.6 MB in the end (delta: 283.1 MB). Free memory was 164.1 MB in the beginning and 448.4 MB in the end (delta: -284.3 MB). Peak memory consumption was 198.6 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:39,278 INFO L168 Benchmark]: Witness Printer took 278.90 ms. Allocated memory is still 487.6 MB. Free memory was 448.4 MB in the beginning and 409.6 MB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:39,281 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.19 ms. Allocated memory is still 161.5 MB. Free memory is still 134.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 749.35 ms. Allocated memory is still 161.5 MB. Free memory was 135.6 MB in the beginning and 108.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 143.32 ms. Allocated memory is still 161.5 MB. Free memory was 108.7 MB in the beginning and 100.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 191.67 ms. Allocated memory is still 161.5 MB. Free memory was 100.8 MB in the beginning and 138.4 MB in the end (delta: -37.6 MB). Peak memory consumption was 12.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1977.11 ms. Allocated memory was 161.5 MB in the beginning and 204.5 MB in the end (delta: 43.0 MB). Free memory was 138.4 MB in the beginning and 164.6 MB in the end (delta: -26.3 MB). Peak memory consumption was 90.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13974.12 ms. Allocated memory was 204.5 MB in the beginning and 487.6 MB in the end (delta: 283.1 MB). Free memory was 164.1 MB in the beginning and 448.4 MB in the end (delta: -284.3 MB). Peak memory consumption was 198.6 MB. Max. memory is 8.0 GB. * Witness Printer took 278.90 ms. Allocated memory is still 487.6 MB. Free memory was 448.4 MB in the beginning and 409.6 MB in the end (delta: 38.8 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: 13.6s, OverallIterations: 13, TraceHistogramMax: 4, AutomataDifference: 8.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.1s 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.7s 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...