/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_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 13:31:59,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 13:31:59,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 13:31:59,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 13:31:59,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 13:31:59,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 13:31:59,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 13:31:59,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 13:31:59,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 13:31:59,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 13:31:59,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 13:31:59,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 13:31:59,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 13:31:59,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 13:31:59,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 13:31:59,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 13:31:59,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 13:31:59,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 13:31:59,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 13:31:59,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 13:31:59,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 13:31:59,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 13:31:59,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 13:31:59,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 13:31:59,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 13:31:59,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 13:31:59,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 13:31:59,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 13:31:59,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 13:31:59,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 13:31:59,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 13:31:59,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 13:31:59,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 13:31:59,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 13:31:59,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 13:31:59,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 13:31:59,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 13:31:59,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 13:31:59,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 13:31:59,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 13:31:59,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 13:31:59,251 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 13:31:59,279 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 13:31:59,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 13:31:59,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 13:31:59,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 13:31:59,282 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 13:31:59,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 13:31:59,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 13:31:59,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 13:31:59,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 13:31:59,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 13:31:59,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 13:31:59,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 13:31:59,283 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 13:31:59,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 13:31:59,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 13:31:59,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 13:31:59,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 13:31:59,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 13:31:59,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 13:31:59,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 13:31:59,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 13:31:59,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 13:31:59,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 13:31:59,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 13:31:59,286 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 13:31:59,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 13:31:59,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 13:31:59,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 13:31:59,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 13:31:59,727 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 13:31:59,728 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 13:31:59,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label42.c [2021-01-06 13:31:59,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ae8b6429a/98fa44d62ca247e6b0a5ca3e59b271db/FLAGc9f1bb43d [2021-01-06 13:32:00,603 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 13:32:00,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label42.c [2021-01-06 13:32:00,636 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ae8b6429a/98fa44d62ca247e6b0a5ca3e59b271db/FLAGc9f1bb43d [2021-01-06 13:32:00,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ae8b6429a/98fa44d62ca247e6b0a5ca3e59b271db [2021-01-06 13:32:00,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 13:32:00,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 13:32:00,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 13:32:00,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 13:32:00,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 13:32:00,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:32:00" (1/1) ... [2021-01-06 13:32:00,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f21a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:32:00, skipping insertion in model container [2021-01-06 13:32:00,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:32:00" (1/1) ... [2021-01-06 13:32:00,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 13:32:00,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 13:32:01,135 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_label42.c[2177,2190] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 13:32:01,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:32:01,433 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 13:32:01,453 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_label42.c[2177,2190] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 13:32:01,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:32:01,718 INFO L208 MainTranslator]: Completed translation [2021-01-06 13:32:01,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:32:01 WrapperNode [2021-01-06 13:32:01,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 13:32:01,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 13:32:01,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 13:32:01,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 13:32:01,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:32:01" (1/1) ... [2021-01-06 13:32:01,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:32:01" (1/1) ... [2021-01-06 13:32:01,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 13:32:01,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 13:32:01,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 13:32:01,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 13:32:01,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:32:01" (1/1) ... [2021-01-06 13:32:01,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:32:01" (1/1) ... [2021-01-06 13:32:01,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:32:01" (1/1) ... [2021-01-06 13:32:01,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:32:01" (1/1) ... [2021-01-06 13:32:01,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:32:01" (1/1) ... [2021-01-06 13:32:01,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:32:01" (1/1) ... [2021-01-06 13:32:01,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:32:01" (1/1) ... [2021-01-06 13:32:01,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 13:32:01,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 13:32:01,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 13:32:01,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 13:32:01,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:32:01" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 13:32:02,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 13:32:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 13:32:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 13:32:02,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 13:32:03,410 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 13:32:03,410 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 13:32:03,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:32:03 BoogieIcfgContainer [2021-01-06 13:32:03,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 13:32:03,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 13:32:03,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 13:32:03,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 13:32:03,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 01:32:00" (1/3) ... [2021-01-06 13:32:03,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f29933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:32:03, skipping insertion in model container [2021-01-06 13:32:03,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:32:01" (2/3) ... [2021-01-06 13:32:03,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f29933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:32:03, skipping insertion in model container [2021-01-06 13:32:03,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:32:03" (3/3) ... [2021-01-06 13:32:03,422 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c [2021-01-06 13:32:03,429 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 13:32:03,435 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 13:32:03,455 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 13:32:03,485 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 13:32:03,486 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 13:32:03,486 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 13:32:03,486 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 13:32:03,486 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 13:32:03,486 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 13:32:03,486 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 13:32:03,487 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 13:32:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2021-01-06 13:32:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 13:32:03,514 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:32:03,515 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:32:03,515 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:32:03,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:32:03,521 INFO L82 PathProgramCache]: Analyzing trace with hash 156847385, now seen corresponding path program 1 times [2021-01-06 13:32:03,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:32:03,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145056516] [2021-01-06 13:32:03,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:32:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:32:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:32:03,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145056516] [2021-01-06 13:32:03,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:32:03,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:32:03,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595621915] [2021-01-06 13:32:03,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:32:03,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:32:03,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:32:03,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:32:03,781 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2021-01-06 13:32:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:32:04,690 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2021-01-06 13:32:04,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:32:04,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2021-01-06 13:32:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:32:04,729 INFO L225 Difference]: With dead ends: 552 [2021-01-06 13:32:04,729 INFO L226 Difference]: Without dead ends: 282 [2021-01-06 13:32:04,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:32:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-01-06 13:32:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-01-06 13:32:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2021-01-06 13:32:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2021-01-06 13:32:04,840 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 17 [2021-01-06 13:32:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:32:04,841 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2021-01-06 13:32:04,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:32:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2021-01-06 13:32:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 13:32:04,844 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:32:04,844 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:32:04,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 13:32:04,845 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:32:04,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:32:04,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1626243535, now seen corresponding path program 1 times [2021-01-06 13:32:04,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:32:04,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816031760] [2021-01-06 13:32:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:32:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:32:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:32:05,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816031760] [2021-01-06 13:32:05,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:32:05,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:32:05,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536793827] [2021-01-06 13:32:05,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:32:05,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:32:05,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:32:05,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:32:05,137 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 3 states. [2021-01-06 13:32:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:32:05,800 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2021-01-06 13:32:05,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:32:05,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-06 13:32:05,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:32:05,806 INFO L225 Difference]: With dead ends: 701 [2021-01-06 13:32:05,806 INFO L226 Difference]: Without dead ends: 421 [2021-01-06 13:32:05,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:32:05,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-01-06 13:32:05,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2021-01-06 13:32:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2021-01-06 13:32:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2021-01-06 13:32:05,829 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 86 [2021-01-06 13:32:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:32:05,830 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2021-01-06 13:32:05,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:32:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2021-01-06 13:32:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 13:32:05,834 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:32:05,834 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:32:05,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 13:32:05,835 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:32:05,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:32:05,836 INFO L82 PathProgramCache]: Analyzing trace with hash -339232224, now seen corresponding path program 1 times [2021-01-06 13:32:05,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:32:05,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968809531] [2021-01-06 13:32:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:32:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:32:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:32:05,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968809531] [2021-01-06 13:32:05,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:32:05,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:32:05,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376482622] [2021-01-06 13:32:05,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:32:05,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:32:06,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:32:06,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:32:06,005 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2021-01-06 13:32:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:32:06,699 INFO L93 Difference]: Finished difference Result 1118 states and 1639 transitions. [2021-01-06 13:32:06,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:32:06,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 13:32:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:32:06,706 INFO L225 Difference]: With dead ends: 1118 [2021-01-06 13:32:06,706 INFO L226 Difference]: Without dead ends: 838 [2021-01-06 13:32:06,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:32:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-01-06 13:32:06,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2021-01-06 13:32:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-01-06 13:32:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 929 transitions. [2021-01-06 13:32:06,736 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 929 transitions. Word has length 92 [2021-01-06 13:32:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:32:06,737 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 929 transitions. [2021-01-06 13:32:06,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:32:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 929 transitions. [2021-01-06 13:32:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-01-06 13:32:06,743 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:32:06,743 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:32:06,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 13:32:06,744 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:32:06,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:32:06,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1297377710, now seen corresponding path program 1 times [2021-01-06 13:32:06,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:32:06,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697071688] [2021-01-06 13:32:06,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:32:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:32:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:32:07,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697071688] [2021-01-06 13:32:07,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:32:07,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:32:07,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880657018] [2021-01-06 13:32:07,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:32:07,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:32:07,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:32:07,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:32:07,037 INFO L87 Difference]: Start difference. First operand 699 states and 929 transitions. Second operand 4 states. [2021-01-06 13:32:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:32:07,826 INFO L93 Difference]: Finished difference Result 1129 states and 1544 transitions. [2021-01-06 13:32:07,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 13:32:07,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2021-01-06 13:32:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:32:07,831 INFO L225 Difference]: With dead ends: 1129 [2021-01-06 13:32:07,831 INFO L226 Difference]: Without dead ends: 571 [2021-01-06 13:32:07,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 13:32:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-01-06 13:32:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 560. [2021-01-06 13:32:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2021-01-06 13:32:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 750 transitions. [2021-01-06 13:32:07,852 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 750 transitions. Word has length 111 [2021-01-06 13:32:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:32:07,853 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 750 transitions. [2021-01-06 13:32:07,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:32:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 750 transitions. [2021-01-06 13:32:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-01-06 13:32:07,861 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:32:07,861 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:32:07,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 13:32:07,862 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:32:07,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:32:07,862 INFO L82 PathProgramCache]: Analyzing trace with hash -464888546, now seen corresponding path program 1 times [2021-01-06 13:32:07,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:32:07,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577548281] [2021-01-06 13:32:07,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:32:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:32:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-01-06 13:32:08,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577548281] [2021-01-06 13:32:08,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:32:08,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:32:08,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158788282] [2021-01-06 13:32:08,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:32:08,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:32:08,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:32:08,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:32:08,042 INFO L87 Difference]: Start difference. First operand 560 states and 750 transitions. Second operand 3 states. [2021-01-06 13:32:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:32:08,656 INFO L93 Difference]: Finished difference Result 1257 states and 1742 transitions. [2021-01-06 13:32:08,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:32:08,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2021-01-06 13:32:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:32:08,667 INFO L225 Difference]: With dead ends: 1257 [2021-01-06 13:32:08,667 INFO L226 Difference]: Without dead ends: 838 [2021-01-06 13:32:08,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:32:08,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-01-06 13:32:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2021-01-06 13:32:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2021-01-06 13:32:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1068 transitions. [2021-01-06 13:32:08,697 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1068 transitions. Word has length 152 [2021-01-06 13:32:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:32:08,697 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1068 transitions. [2021-01-06 13:32:08,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:32:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1068 transitions. [2021-01-06 13:32:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 13:32:08,703 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:32:08,703 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 13:32:08,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 13:32:08,704 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:32:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:32:08,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1850532111, now seen corresponding path program 1 times [2021-01-06 13:32:08,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:32:08,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578798902] [2021-01-06 13:32:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:32:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:32:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:32:08,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578798902] [2021-01-06 13:32:08,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:32:08,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:32:08,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147163976] [2021-01-06 13:32:08,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:32:08,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:32:08,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:32:08,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:32:08,916 INFO L87 Difference]: Start difference. First operand 838 states and 1068 transitions. Second operand 3 states. [2021-01-06 13:32:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:32:09,486 INFO L93 Difference]: Finished difference Result 1813 states and 2369 transitions. [2021-01-06 13:32:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:32:09,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2021-01-06 13:32:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:32:09,494 INFO L225 Difference]: With dead ends: 1813 [2021-01-06 13:32:09,495 INFO L226 Difference]: Without dead ends: 1116 [2021-01-06 13:32:09,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:32:09,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2021-01-06 13:32:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 977. [2021-01-06 13:32:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2021-01-06 13:32:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1217 transitions. [2021-01-06 13:32:09,525 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1217 transitions. Word has length 169 [2021-01-06 13:32:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:32:09,525 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 1217 transitions. [2021-01-06 13:32:09,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:32:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1217 transitions. [2021-01-06 13:32:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-01-06 13:32:09,529 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:32:09,529 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 13:32:09,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 13:32:09,530 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:32:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:32:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1198986008, now seen corresponding path program 1 times [2021-01-06 13:32:09,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:32:09,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927384464] [2021-01-06 13:32:09,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:32:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 13:32:09,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 13:32:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 13:32:09,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 13:32:09,727 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 13:32:09,728 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 13:32:09,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 13:32:09,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 01:32:09 BoogieIcfgContainer [2021-01-06 13:32:09,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 13:32:09,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 13:32:09,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 13:32:09,919 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 13:32:09,919 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:32:03" (3/4) ... [2021-01-06 13:32:09,921 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 13:32:10,088 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem10_label42.c-witness.graphml [2021-01-06 13:32:10,088 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 13:32:10,090 INFO L168 Benchmark]: Toolchain (without parser) took 9232.29 ms. Allocated memory was 151.0 MB in the beginning and 238.0 MB in the end (delta: 87.0 MB). Free memory was 124.8 MB in the beginning and 120.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 92.6 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:10,091 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory was 124.6 MB in the beginning and 124.5 MB in the end (delta: 77.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 13:32:10,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 856.06 ms. Allocated memory is still 151.0 MB. Free memory was 124.6 MB in the beginning and 128.5 MB in the end (delta: -4.0 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:10,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.33 ms. Allocated memory is still 151.0 MB. Free memory was 128.5 MB in the beginning and 120.7 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:10,092 INFO L168 Benchmark]: Boogie Preprocessor took 126.47 ms. Allocated memory is still 151.0 MB. Free memory was 120.7 MB in the beginning and 115.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:10,092 INFO L168 Benchmark]: RCFGBuilder took 1417.91 ms. Allocated memory is still 151.0 MB. Free memory was 115.4 MB in the beginning and 93.0 MB in the end (delta: 22.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:10,093 INFO L168 Benchmark]: TraceAbstraction took 6503.75 ms. Allocated memory was 151.0 MB in the beginning and 238.0 MB in the end (delta: 87.0 MB). Free memory was 92.5 MB in the beginning and 144.4 MB in the end (delta: -51.9 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:10,093 INFO L168 Benchmark]: Witness Printer took 169.72 ms. Allocated memory is still 238.0 MB. Free memory was 144.4 MB in the beginning and 120.7 MB in the end (delta: 23.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:10,096 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.23 ms. Allocated memory is still 151.0 MB. Free memory was 124.6 MB in the beginning and 124.5 MB in the end (delta: 77.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 856.06 ms. Allocated memory is still 151.0 MB. Free memory was 124.6 MB in the beginning and 128.5 MB in the end (delta: -4.0 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 146.33 ms. Allocated memory is still 151.0 MB. Free memory was 128.5 MB in the beginning and 120.7 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 126.47 ms. Allocated memory is still 151.0 MB. Free memory was 120.7 MB in the beginning and 115.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1417.91 ms. Allocated memory is still 151.0 MB. Free memory was 115.4 MB in the beginning and 93.0 MB in the end (delta: 22.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6503.75 ms. Allocated memory was 151.0 MB in the beginning and 238.0 MB in the end (delta: 87.0 MB). Free memory was 92.5 MB in the beginning and 144.4 MB in the end (delta: -51.9 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. * Witness Printer took 169.72 ms. Allocated memory is still 238.0 MB. Free memory was 144.4 MB in the beginning and 120.7 MB in the end (delta: 23.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 65]: 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 TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L221] a1 = (((a1 + -15535) - 211896) / 5) [L222] a10 = 2 [L224] return 22; VAL [a1=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, 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=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L419] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L420] a10 = 0 [L421] a19 = 8 [L423] return -1; VAL [a1=254627, a10=0, a12=0, a19=8, 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=254627, a10=0, a12=0, a19=8, 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=254627, a10=0, a12=0, a19=8, 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=254627, a10=0, a12=0, a19=8, 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=254627, a10=0, a12=0, a19=8, 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=254627, a10=0, a12=0, a19=8, 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=254627, a10=0, a12=0, a19=8, 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=254627, a10=0, a12=0, a19=8, 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=254627, a10=0, a12=0, a19=8, 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=254627, a10=0, a12=0, a19=8, 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=254627, a10=0, a12=0, a19=8, 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=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] reach_error() VAL [a1=254627, a10=0, a12=0, a19=8, 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: 6.2s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 661 SDtfs, 648 SDslu, 34 SDs, 0 SdLazy, 2372 SolverSat, 488 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=977occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 289 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 818 NumberOfCodeBlocks, 818 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 621 ConstructedInterpolants, 0 QuantifiedInterpolants, 341723 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 230/230 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...