/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/Problem14_label48.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 14:15:51,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 14:15:51,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 14:15:51,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 14:15:51,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 14:15:51,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 14:15:51,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 14:15:51,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 14:15:51,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 14:15:51,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 14:15:51,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 14:15:51,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 14:15:51,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 14:15:51,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 14:15:51,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 14:15:51,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 14:15:51,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 14:15:51,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 14:15:51,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 14:15:51,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 14:15:51,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 14:15:51,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 14:15:51,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 14:15:51,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 14:15:51,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 14:15:51,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 14:15:51,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 14:15:51,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 14:15:51,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 14:15:51,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 14:15:51,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 14:15:51,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 14:15:51,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 14:15:51,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 14:15:51,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 14:15:51,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 14:15:51,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 14:15:51,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 14:15:51,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 14:15:51,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 14:15:51,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 14:15:51,541 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 14:15:51,589 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 14:15:51,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 14:15:51,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 14:15:51,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 14:15:51,593 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 14:15:51,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 14:15:51,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 14:15:51,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 14:15:51,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 14:15:51,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 14:15:51,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 14:15:51,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 14:15:51,596 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 14:15:51,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 14:15:51,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 14:15:51,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 14:15:51,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 14:15:51,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 14:15:51,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 14:15:51,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 14:15:51,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 14:15:51,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 14:15:51,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 14:15:51,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 14:15:51,598 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 14:15:51,598 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 14:15:52,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 14:15:52,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 14:15:52,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 14:15:52,039 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 14:15:52,040 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 14:15:52,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label48.c [2021-01-06 14:15:52,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/beebea5b5/caea09efef344fb5adc03bc214bd0b58/FLAGb1e68ca8d [2021-01-06 14:15:52,983 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 14:15:52,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label48.c [2021-01-06 14:15:53,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/beebea5b5/caea09efef344fb5adc03bc214bd0b58/FLAGb1e68ca8d [2021-01-06 14:15:53,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/beebea5b5/caea09efef344fb5adc03bc214bd0b58 [2021-01-06 14:15:53,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 14:15:53,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 14:15:53,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 14:15:53,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 14:15:53,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 14:15:53,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 02:15:53" (1/1) ... [2021-01-06 14:15:53,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348599a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:53, skipping insertion in model container [2021-01-06 14:15:53,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 02:15:53" (1/1) ... [2021-01-06 14:15:53,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 14:15:53,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 14:15:53,563 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/Problem14_label48.c[4040,4053] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~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 14:15:53,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 14:15:53,912 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 14:15:53,959 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/Problem14_label48.c[4040,4053] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~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 14:15:54,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 14:15:54,132 INFO L208 MainTranslator]: Completed translation [2021-01-06 14:15:54,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:54 WrapperNode [2021-01-06 14:15:54,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 14:15:54,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 14:15:54,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 14:15:54,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 14:15:54,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:54" (1/1) ... [2021-01-06 14:15:54,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:54" (1/1) ... [2021-01-06 14:15:54,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 14:15:54,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 14:15:54,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 14:15:54,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 14:15:54,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:54" (1/1) ... [2021-01-06 14:15:54,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:54" (1/1) ... [2021-01-06 14:15:54,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:54" (1/1) ... [2021-01-06 14:15:54,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:54" (1/1) ... [2021-01-06 14:15:54,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:54" (1/1) ... [2021-01-06 14:15:54,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:54" (1/1) ... [2021-01-06 14:15:54,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:54" (1/1) ... [2021-01-06 14:15:54,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 14:15:54,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 14:15:54,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 14:15:54,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 14:15:54,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:54" (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 14:15:54,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 14:15:54,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 14:15:54,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 14:15:54,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 14:15:56,402 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 14:15:56,403 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 14:15:56,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:15:56 BoogieIcfgContainer [2021-01-06 14:15:56,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 14:15:56,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 14:15:56,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 14:15:56,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 14:15:56,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 02:15:53" (1/3) ... [2021-01-06 14:15:56,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c51558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 02:15:56, skipping insertion in model container [2021-01-06 14:15:56,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:54" (2/3) ... [2021-01-06 14:15:56,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c51558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 02:15:56, skipping insertion in model container [2021-01-06 14:15:56,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:15:56" (3/3) ... [2021-01-06 14:15:56,415 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label48.c [2021-01-06 14:15:56,422 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 14:15:56,428 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 14:15:56,447 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 14:15:56,476 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 14:15:56,476 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 14:15:56,476 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 14:15:56,477 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 14:15:56,477 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 14:15:56,477 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 14:15:56,477 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 14:15:56,477 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 14:15:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2021-01-06 14:15:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 14:15:56,508 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:56,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:15:56,512 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:56,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2021-01-06 14:15:56,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:56,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451189053] [2021-01-06 14:15:56,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:56,870 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 14:15:56,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451189053] [2021-01-06 14:15:56,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:15:56,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:15:56,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804691542] [2021-01-06 14:15:56,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:15:56,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:56,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:15:56,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:15:56,898 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2021-01-06 14:15:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:59,133 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2021-01-06 14:15:59,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:15:59,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2021-01-06 14:15:59,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:59,159 INFO L225 Difference]: With dead ends: 852 [2021-01-06 14:15:59,159 INFO L226 Difference]: Without dead ends: 538 [2021-01-06 14:15:59,164 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 14:15:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-01-06 14:15:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2021-01-06 14:15:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2021-01-06 14:15:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2021-01-06 14:15:59,256 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 38 [2021-01-06 14:15:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:59,256 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2021-01-06 14:15:59,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:15:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2021-01-06 14:15:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-01-06 14:15:59,278 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:59,278 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 14:15:59,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 14:15:59,279 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:59,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:59,279 INFO L82 PathProgramCache]: Analyzing trace with hash -644661184, now seen corresponding path program 1 times [2021-01-06 14:15:59,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:59,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300087110] [2021-01-06 14:15:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-01-06 14:15:59,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300087110] [2021-01-06 14:15:59,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:15:59,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 14:15:59,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303394759] [2021-01-06 14:15:59,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:59,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:59,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:59,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:15:59,595 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand 3 states. [2021-01-06 14:16:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:00,629 INFO L93 Difference]: Finished difference Result 1074 states and 1656 transitions. [2021-01-06 14:16:00,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:00,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2021-01-06 14:16:00,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:00,634 INFO L225 Difference]: With dead ends: 1074 [2021-01-06 14:16:00,634 INFO L226 Difference]: Without dead ends: 716 [2021-01-06 14:16:00,637 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 14:16:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-01-06 14:16:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-01-06 14:16:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2021-01-06 14:16:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2021-01-06 14:16:00,675 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 186 [2021-01-06 14:16:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:00,676 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2021-01-06 14:16:00,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2021-01-06 14:16:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-01-06 14:16:00,680 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:00,681 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:00,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 14:16:00,681 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:00,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:00,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1687240179, now seen corresponding path program 1 times [2021-01-06 14:16:00,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:00,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492990269] [2021-01-06 14:16:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 14:16:01,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492990269] [2021-01-06 14:16:01,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:01,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:01,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838075270] [2021-01-06 14:16:01,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:01,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:01,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:01,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:01,087 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand 4 states. [2021-01-06 14:16:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:02,199 INFO L93 Difference]: Finished difference Result 1637 states and 2268 transitions. [2021-01-06 14:16:02,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:02,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2021-01-06 14:16:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:02,206 INFO L225 Difference]: With dead ends: 1637 [2021-01-06 14:16:02,206 INFO L226 Difference]: Without dead ends: 1072 [2021-01-06 14:16:02,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2021-01-06 14:16:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 894. [2021-01-06 14:16:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2021-01-06 14:16:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1047 transitions. [2021-01-06 14:16:02,233 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1047 transitions. Word has length 209 [2021-01-06 14:16:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:02,234 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 1047 transitions. [2021-01-06 14:16:02,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1047 transitions. [2021-01-06 14:16:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2021-01-06 14:16:02,241 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:02,242 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:02,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 14:16:02,242 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:02,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:02,243 INFO L82 PathProgramCache]: Analyzing trace with hash -525447176, now seen corresponding path program 1 times [2021-01-06 14:16:02,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:02,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3359470] [2021-01-06 14:16:02,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 238 proven. 100 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-01-06 14:16:03,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3359470] [2021-01-06 14:16:03,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203383638] [2021-01-06 14:16:03,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:03,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:16:03,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2021-01-06 14:16:04,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:04,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:16:04,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032077933] [2021-01-06 14:16:04,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:04,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:04,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:04,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:04,123 INFO L87 Difference]: Start difference. First operand 894 states and 1047 transitions. Second operand 3 states. [2021-01-06 14:16:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:04,938 INFO L93 Difference]: Finished difference Result 2320 states and 2778 transitions. [2021-01-06 14:16:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:04,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2021-01-06 14:16:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:04,951 INFO L225 Difference]: With dead ends: 2320 [2021-01-06 14:16:04,951 INFO L226 Difference]: Without dead ends: 1606 [2021-01-06 14:16:04,953 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2021-01-06 14:16:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2021-01-06 14:16:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2021-01-06 14:16:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1627 transitions. [2021-01-06 14:16:04,989 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1627 transitions. Word has length 340 [2021-01-06 14:16:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:04,993 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 1627 transitions. [2021-01-06 14:16:04,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1627 transitions. [2021-01-06 14:16:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2021-01-06 14:16:05,004 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:05,004 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:05,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:05,220 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:05,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:05,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1515675842, now seen corresponding path program 1 times [2021-01-06 14:16:05,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:05,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057257816] [2021-01-06 14:16:05,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-01-06 14:16:05,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057257816] [2021-01-06 14:16:05,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:05,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:05,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979643803] [2021-01-06 14:16:05,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:05,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:05,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:05,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:05,715 INFO L87 Difference]: Start difference. First operand 1428 states and 1627 transitions. Second operand 3 states. [2021-01-06 14:16:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:06,516 INFO L93 Difference]: Finished difference Result 3210 states and 3757 transitions. [2021-01-06 14:16:06,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:06,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 439 [2021-01-06 14:16:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:06,528 INFO L225 Difference]: With dead ends: 3210 [2021-01-06 14:16:06,528 INFO L226 Difference]: Without dead ends: 1962 [2021-01-06 14:16:06,531 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 14:16:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2021-01-06 14:16:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2021-01-06 14:16:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2021-01-06 14:16:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2022 transitions. [2021-01-06 14:16:06,581 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2022 transitions. Word has length 439 [2021-01-06 14:16:06,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:06,582 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2022 transitions. [2021-01-06 14:16:06,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2022 transitions. [2021-01-06 14:16:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2021-01-06 14:16:06,594 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:06,595 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:06,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 14:16:06,596 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:06,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:06,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1446360066, now seen corresponding path program 1 times [2021-01-06 14:16:06,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:06,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031646807] [2021-01-06 14:16:06,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 529 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 14:16:07,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031646807] [2021-01-06 14:16:07,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257361728] [2021-01-06 14:16:07,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:07,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:16:07,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 14:16:08,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:08,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:16:08,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396857380] [2021-01-06 14:16:08,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:08,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:08,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:08,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:08,575 INFO L87 Difference]: Start difference. First operand 1784 states and 2022 transitions. Second operand 4 states. [2021-01-06 14:16:09,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:09,710 INFO L93 Difference]: Finished difference Result 3744 states and 4272 transitions. [2021-01-06 14:16:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:09,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 463 [2021-01-06 14:16:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:09,723 INFO L225 Difference]: With dead ends: 3744 [2021-01-06 14:16:09,726 INFO L226 Difference]: Without dead ends: 1962 [2021-01-06 14:16:09,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2021-01-06 14:16:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2021-01-06 14:16:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2021-01-06 14:16:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2219 transitions. [2021-01-06 14:16:09,785 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2219 transitions. Word has length 463 [2021-01-06 14:16:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:09,787 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 2219 transitions. [2021-01-06 14:16:09,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2219 transitions. [2021-01-06 14:16:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2021-01-06 14:16:09,802 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:09,802 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:10,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:10,016 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:10,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:10,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1587713622, now seen corresponding path program 1 times [2021-01-06 14:16:10,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:10,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158919689] [2021-01-06 14:16:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 698 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2021-01-06 14:16:10,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158919689] [2021-01-06 14:16:10,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:10,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:10,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592466484] [2021-01-06 14:16:10,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:10,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:10,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:10,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:10,587 INFO L87 Difference]: Start difference. First operand 1962 states and 2219 transitions. Second operand 4 states. [2021-01-06 14:16:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:11,391 INFO L93 Difference]: Finished difference Result 3773 states and 4286 transitions. [2021-01-06 14:16:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:11,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 519 [2021-01-06 14:16:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:11,402 INFO L225 Difference]: With dead ends: 3773 [2021-01-06 14:16:11,402 INFO L226 Difference]: Without dead ends: 1962 [2021-01-06 14:16:11,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2021-01-06 14:16:11,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2021-01-06 14:16:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2021-01-06 14:16:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2142 transitions. [2021-01-06 14:16:11,445 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2142 transitions. Word has length 519 [2021-01-06 14:16:11,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:11,446 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 2142 transitions. [2021-01-06 14:16:11,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2142 transitions. [2021-01-06 14:16:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2021-01-06 14:16:11,452 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:11,452 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:11,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 14:16:11,453 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:11,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:11,453 INFO L82 PathProgramCache]: Analyzing trace with hash -319638967, now seen corresponding path program 2 times [2021-01-06 14:16:11,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:11,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571392479] [2021-01-06 14:16:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 775 proven. 11 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-01-06 14:16:12,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571392479] [2021-01-06 14:16:12,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023303696] [2021-01-06 14:16:12,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:12,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 14:16:12,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 14:16:12,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 14:16:12,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:13,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 786 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-01-06 14:16:13,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:13,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-01-06 14:16:13,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936965186] [2021-01-06 14:16:13,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 14:16:13,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 14:16:13,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:16:13,637 INFO L87 Difference]: Start difference. First operand 1962 states and 2142 transitions. Second operand 5 states. [2021-01-06 14:16:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:15,036 INFO L93 Difference]: Finished difference Result 4129 states and 4557 transitions. [2021-01-06 14:16:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 14:16:15,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 545 [2021-01-06 14:16:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:15,047 INFO L225 Difference]: With dead ends: 4129 [2021-01-06 14:16:15,047 INFO L226 Difference]: Without dead ends: 2347 [2021-01-06 14:16:15,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:16:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2021-01-06 14:16:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 2140. [2021-01-06 14:16:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2021-01-06 14:16:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2324 transitions. [2021-01-06 14:16:15,096 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2324 transitions. Word has length 545 [2021-01-06 14:16:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:15,097 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2324 transitions. [2021-01-06 14:16:15,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 14:16:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2324 transitions. [2021-01-06 14:16:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2021-01-06 14:16:15,102 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:15,103 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:15,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:15,318 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:15,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:15,319 INFO L82 PathProgramCache]: Analyzing trace with hash 245952814, now seen corresponding path program 1 times [2021-01-06 14:16:15,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:15,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743099906] [2021-01-06 14:16:15,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 788 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-01-06 14:16:15,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743099906] [2021-01-06 14:16:15,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:15,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:15,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193337485] [2021-01-06 14:16:15,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:15,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:15,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:15,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:15,936 INFO L87 Difference]: Start difference. First operand 2140 states and 2324 transitions. Second operand 3 states. [2021-01-06 14:16:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:16,689 INFO L93 Difference]: Finished difference Result 4812 states and 5286 transitions. [2021-01-06 14:16:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:16,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 552 [2021-01-06 14:16:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:16,702 INFO L225 Difference]: With dead ends: 4812 [2021-01-06 14:16:16,702 INFO L226 Difference]: Without dead ends: 2852 [2021-01-06 14:16:16,705 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 14:16:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2021-01-06 14:16:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2021-01-06 14:16:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2021-01-06 14:16:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2896 transitions. [2021-01-06 14:16:16,759 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2896 transitions. Word has length 552 [2021-01-06 14:16:16,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:16,759 INFO L481 AbstractCegarLoop]: Abstraction has 2674 states and 2896 transitions. [2021-01-06 14:16:16,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2896 transitions. [2021-01-06 14:16:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2021-01-06 14:16:16,766 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:16,767 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:16,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 14:16:16,767 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:16,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:16,768 INFO L82 PathProgramCache]: Analyzing trace with hash -639056134, now seen corresponding path program 1 times [2021-01-06 14:16:16,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:16,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193846] [2021-01-06 14:16:16,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 589 proven. 195 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2021-01-06 14:16:18,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193846] [2021-01-06 14:16:18,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071819205] [2021-01-06 14:16:18,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:18,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:16:18,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 686 trivial. 0 not checked. [2021-01-06 14:16:19,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:19,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2021-01-06 14:16:19,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822074666] [2021-01-06 14:16:19,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:19,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:19,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:19,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:19,596 INFO L87 Difference]: Start difference. First operand 2674 states and 2896 transitions. Second operand 3 states. [2021-01-06 14:16:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:20,234 INFO L93 Difference]: Finished difference Result 5168 states and 5611 transitions. [2021-01-06 14:16:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:20,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 615 [2021-01-06 14:16:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:20,248 INFO L225 Difference]: With dead ends: 5168 [2021-01-06 14:16:20,248 INFO L226 Difference]: Without dead ends: 2674 [2021-01-06 14:16:20,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:20,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2021-01-06 14:16:20,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2674. [2021-01-06 14:16:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2021-01-06 14:16:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2878 transitions. [2021-01-06 14:16:20,301 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2878 transitions. Word has length 615 [2021-01-06 14:16:20,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:20,302 INFO L481 AbstractCegarLoop]: Abstraction has 2674 states and 2878 transitions. [2021-01-06 14:16:20,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2878 transitions. [2021-01-06 14:16:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2021-01-06 14:16:20,308 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:20,309 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2021-01-06 14:16:20,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:20,525 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:20,526 INFO L82 PathProgramCache]: Analyzing trace with hash -166196995, now seen corresponding path program 1 times [2021-01-06 14:16:20,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:20,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799715251] [2021-01-06 14:16:20,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-01-06 14:16:21,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799715251] [2021-01-06 14:16:21,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:21,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:21,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251680403] [2021-01-06 14:16:21,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:21,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:21,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:21,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:21,112 INFO L87 Difference]: Start difference. First operand 2674 states and 2878 transitions. Second operand 3 states. [2021-01-06 14:16:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:21,795 INFO L93 Difference]: Finished difference Result 6058 states and 6559 transitions. [2021-01-06 14:16:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:21,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 619 [2021-01-06 14:16:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:21,810 INFO L225 Difference]: With dead ends: 6058 [2021-01-06 14:16:21,810 INFO L226 Difference]: Without dead ends: 3564 [2021-01-06 14:16:21,814 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 14:16:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2021-01-06 14:16:21,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2021-01-06 14:16:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2021-01-06 14:16:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3814 transitions. [2021-01-06 14:16:21,879 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3814 transitions. Word has length 619 [2021-01-06 14:16:21,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:21,880 INFO L481 AbstractCegarLoop]: Abstraction has 3564 states and 3814 transitions. [2021-01-06 14:16:21,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3814 transitions. [2021-01-06 14:16:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2021-01-06 14:16:21,889 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:21,890 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 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 14:16:21,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 14:16:21,890 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:21,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:21,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1384462902, now seen corresponding path program 1 times [2021-01-06 14:16:21,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:21,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574059993] [2021-01-06 14:16:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1234 proven. 155 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-01-06 14:16:22,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574059993] [2021-01-06 14:16:22,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238796129] [2021-01-06 14:16:22,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:23,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:16:23,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1234 proven. 155 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-01-06 14:16:24,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 14:16:24,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 14:16:24,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992875169] [2021-01-06 14:16:24,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:24,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:24,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:24,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:24,213 INFO L87 Difference]: Start difference. First operand 3564 states and 3814 transitions. Second operand 4 states. [2021-01-06 14:16:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:25,278 INFO L93 Difference]: Finished difference Result 8194 states and 8798 transitions. [2021-01-06 14:16:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:25,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 774 [2021-01-06 14:16:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:25,299 INFO L225 Difference]: With dead ends: 8194 [2021-01-06 14:16:25,300 INFO L226 Difference]: Without dead ends: 4810 [2021-01-06 14:16:25,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 775 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-01-06 14:16:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4276. [2021-01-06 14:16:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2021-01-06 14:16:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4589 transitions. [2021-01-06 14:16:25,408 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4589 transitions. Word has length 774 [2021-01-06 14:16:25,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:25,410 INFO L481 AbstractCegarLoop]: Abstraction has 4276 states and 4589 transitions. [2021-01-06 14:16:25,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4589 transitions. [2021-01-06 14:16:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2021-01-06 14:16:25,421 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:25,422 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:25,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 14:16:25,637 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:25,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:25,637 INFO L82 PathProgramCache]: Analyzing trace with hash -703064065, now seen corresponding path program 1 times [2021-01-06 14:16:25,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:25,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315654189] [2021-01-06 14:16:25,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 1614 proven. 260 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2021-01-06 14:16:27,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315654189] [2021-01-06 14:16:27,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984049291] [2021-01-06 14:16:27,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:27,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:16:27,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 1665 proven. 0 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2021-01-06 14:16:28,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:28,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 14:16:28,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113017104] [2021-01-06 14:16:28,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:28,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:28,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:28,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:28,624 INFO L87 Difference]: Start difference. First operand 4276 states and 4589 transitions. Second operand 3 states. [2021-01-06 14:16:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:29,260 INFO L93 Difference]: Finished difference Result 8728 states and 9361 transitions. [2021-01-06 14:16:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:29,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 825 [2021-01-06 14:16:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:29,282 INFO L225 Difference]: With dead ends: 8728 [2021-01-06 14:16:29,282 INFO L226 Difference]: Without dead ends: 4632 [2021-01-06 14:16:29,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2021-01-06 14:16:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2021-01-06 14:16:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:16:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4928 transitions. [2021-01-06 14:16:29,369 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4928 transitions. Word has length 825 [2021-01-06 14:16:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:29,370 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4928 transitions. [2021-01-06 14:16:29,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4928 transitions. [2021-01-06 14:16:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2021-01-06 14:16:29,382 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:29,383 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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 14:16:29,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:29,598 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:29,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:29,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1452861494, now seen corresponding path program 1 times [2021-01-06 14:16:29,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:29,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46462390] [2021-01-06 14:16:29,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2206 backedges. 1415 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2021-01-06 14:16:30,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46462390] [2021-01-06 14:16:30,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:30,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:30,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943088019] [2021-01-06 14:16:30,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:30,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:30,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:30,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:30,321 INFO L87 Difference]: Start difference. First operand 4632 states and 4928 transitions. Second operand 3 states. [2021-01-06 14:16:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:31,020 INFO L93 Difference]: Finished difference Result 9974 states and 10683 transitions. [2021-01-06 14:16:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:31,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 846 [2021-01-06 14:16:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:31,051 INFO L225 Difference]: With dead ends: 9974 [2021-01-06 14:16:31,051 INFO L226 Difference]: Without dead ends: 5522 [2021-01-06 14:16:31,058 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 14:16:31,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2021-01-06 14:16:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5344. [2021-01-06 14:16:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2021-01-06 14:16:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5701 transitions. [2021-01-06 14:16:31,143 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5701 transitions. Word has length 846 [2021-01-06 14:16:31,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:31,143 INFO L481 AbstractCegarLoop]: Abstraction has 5344 states and 5701 transitions. [2021-01-06 14:16:31,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5701 transitions. [2021-01-06 14:16:31,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2021-01-06 14:16:31,155 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:31,155 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 14:16:31,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 14:16:31,156 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:31,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:31,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1789463556, now seen corresponding path program 1 times [2021-01-06 14:16:31,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:31,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16725297] [2021-01-06 14:16:31,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:32,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2438 backedges. 1701 proven. 260 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2021-01-06 14:16:32,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16725297] [2021-01-06 14:16:32,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105370952] [2021-01-06 14:16:32,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:32,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:16:32,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2438 backedges. 1647 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2021-01-06 14:16:34,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:34,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 14:16:34,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632866194] [2021-01-06 14:16:34,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:34,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:34,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:34,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:16:34,195 INFO L87 Difference]: Start difference. First operand 5344 states and 5701 transitions. Second operand 4 states. [2021-01-06 14:16:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:35,241 INFO L93 Difference]: Finished difference Result 10508 states and 11221 transitions. [2021-01-06 14:16:35,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:35,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 903 [2021-01-06 14:16:35,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:35,255 INFO L225 Difference]: With dead ends: 10508 [2021-01-06 14:16:35,256 INFO L226 Difference]: Without dead ends: 5166 [2021-01-06 14:16:35,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 901 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:16:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2021-01-06 14:16:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4810. [2021-01-06 14:16:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2021-01-06 14:16:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5135 transitions. [2021-01-06 14:16:35,341 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5135 transitions. Word has length 903 [2021-01-06 14:16:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:35,342 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 5135 transitions. [2021-01-06 14:16:35,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5135 transitions. [2021-01-06 14:16:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 933 [2021-01-06 14:16:35,353 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:35,354 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 14:16:35,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 14:16:35,568 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:35,569 INFO L82 PathProgramCache]: Analyzing trace with hash -149204083, now seen corresponding path program 1 times [2021-01-06 14:16:35,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:35,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533475000] [2021-01-06 14:16:35,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2493 backedges. 1702 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2021-01-06 14:16:36,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533475000] [2021-01-06 14:16:36,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:36,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:36,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254008405] [2021-01-06 14:16:36,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:36,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:36,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:36,748 INFO L87 Difference]: Start difference. First operand 4810 states and 5135 transitions. Second operand 3 states. [2021-01-06 14:16:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:37,521 INFO L93 Difference]: Finished difference Result 9262 states and 9909 transitions. [2021-01-06 14:16:37,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:37,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 932 [2021-01-06 14:16:37,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:37,533 INFO L225 Difference]: With dead ends: 9262 [2021-01-06 14:16:37,533 INFO L226 Difference]: Without dead ends: 4632 [2021-01-06 14:16:37,539 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 14:16:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2021-01-06 14:16:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2021-01-06 14:16:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:16:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4907 transitions. [2021-01-06 14:16:37,604 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4907 transitions. Word has length 932 [2021-01-06 14:16:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:37,604 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4907 transitions. [2021-01-06 14:16:37,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4907 transitions. [2021-01-06 14:16:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 942 [2021-01-06 14:16:37,615 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:37,616 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:37,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 14:16:37,616 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash 377118381, now seen corresponding path program 1 times [2021-01-06 14:16:37,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:37,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293603100] [2021-01-06 14:16:37,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1777 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2021-01-06 14:16:38,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293603100] [2021-01-06 14:16:38,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60362720] [2021-01-06 14:16:38,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:38,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 14:16:38,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1490 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2021-01-06 14:16:39,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:39,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2021-01-06 14:16:39,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037099787] [2021-01-06 14:16:39,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:39,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:39,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:39,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:39,962 INFO L87 Difference]: Start difference. First operand 4632 states and 4907 transitions. Second operand 4 states. [2021-01-06 14:16:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:41,246 INFO L93 Difference]: Finished difference Result 10686 states and 11308 transitions. [2021-01-06 14:16:41,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:41,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 941 [2021-01-06 14:16:41,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:41,261 INFO L225 Difference]: With dead ends: 10686 [2021-01-06 14:16:41,261 INFO L226 Difference]: Without dead ends: 6056 [2021-01-06 14:16:41,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 945 GetRequests, 940 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2021-01-06 14:16:41,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5344. [2021-01-06 14:16:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2021-01-06 14:16:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5653 transitions. [2021-01-06 14:16:41,355 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5653 transitions. Word has length 941 [2021-01-06 14:16:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:41,356 INFO L481 AbstractCegarLoop]: Abstraction has 5344 states and 5653 transitions. [2021-01-06 14:16:41,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5653 transitions. [2021-01-06 14:16:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1102 [2021-01-06 14:16:41,372 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:41,373 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:41,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 14:16:41,588 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:41,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:41,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1328529225, now seen corresponding path program 1 times [2021-01-06 14:16:41,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:41,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387490464] [2021-01-06 14:16:41,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 1629 proven. 0 refuted. 0 times theorem prover too weak. 1787 trivial. 0 not checked. [2021-01-06 14:16:42,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387490464] [2021-01-06 14:16:42,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:42,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:42,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320576984] [2021-01-06 14:16:42,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:42,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:42,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:42,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:42,621 INFO L87 Difference]: Start difference. First operand 5344 states and 5653 transitions. Second operand 3 states. [2021-01-06 14:16:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:43,422 INFO L93 Difference]: Finished difference Result 10508 states and 11125 transitions. [2021-01-06 14:16:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:43,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1101 [2021-01-06 14:16:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:43,436 INFO L225 Difference]: With dead ends: 10508 [2021-01-06 14:16:43,436 INFO L226 Difference]: Without dead ends: 5344 [2021-01-06 14:16:43,442 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 14:16:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2021-01-06 14:16:43,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4988. [2021-01-06 14:16:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2021-01-06 14:16:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5211 transitions. [2021-01-06 14:16:43,545 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5211 transitions. Word has length 1101 [2021-01-06 14:16:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:43,546 INFO L481 AbstractCegarLoop]: Abstraction has 4988 states and 5211 transitions. [2021-01-06 14:16:43,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5211 transitions. [2021-01-06 14:16:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1652 [2021-01-06 14:16:43,589 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:43,591 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:43,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 14:16:43,591 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:43,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash 292188241, now seen corresponding path program 1 times [2021-01-06 14:16:43,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:43,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182791743] [2021-01-06 14:16:43,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8364 backedges. 1706 proven. 1045 refuted. 0 times theorem prover too weak. 5613 trivial. 0 not checked. [2021-01-06 14:16:46,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182791743] [2021-01-06 14:16:46,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111181951] [2021-01-06 14:16:46,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:47,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 2020 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:16:47,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8364 backedges. 2751 proven. 0 refuted. 0 times theorem prover too weak. 5613 trivial. 0 not checked. [2021-01-06 14:16:49,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:49,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:16:49,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627692736] [2021-01-06 14:16:49,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:49,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:49,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:49,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:49,567 INFO L87 Difference]: Start difference. First operand 4988 states and 5211 transitions. Second operand 3 states. [2021-01-06 14:16:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:50,215 INFO L93 Difference]: Finished difference Result 11220 states and 11693 transitions. [2021-01-06 14:16:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:50,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1651 [2021-01-06 14:16:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:50,225 INFO L225 Difference]: With dead ends: 11220 [2021-01-06 14:16:50,226 INFO L226 Difference]: Without dead ends: 3920 [2021-01-06 14:16:50,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1654 GetRequests, 1650 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-01-06 14:16:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3920. [2021-01-06 14:16:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2021-01-06 14:16:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4016 transitions. [2021-01-06 14:16:50,290 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4016 transitions. Word has length 1651 [2021-01-06 14:16:50,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:50,291 INFO L481 AbstractCegarLoop]: Abstraction has 3920 states and 4016 transitions. [2021-01-06 14:16:50,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4016 transitions. [2021-01-06 14:16:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1723 [2021-01-06 14:16:50,320 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:50,321 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:50,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:50,535 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:50,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:50,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1151917844, now seen corresponding path program 1 times [2021-01-06 14:16:50,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:50,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347628060] [2021-01-06 14:16:50,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9629 backedges. 1553 proven. 0 refuted. 0 times theorem prover too weak. 8076 trivial. 0 not checked. [2021-01-06 14:16:54,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347628060] [2021-01-06 14:16:54,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:54,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 14:16:54,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20454428] [2021-01-06 14:16:54,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 14:16:54,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:54,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 14:16:54,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:16:54,755 INFO L87 Difference]: Start difference. First operand 3920 states and 4016 transitions. Second operand 5 states. [2021-01-06 14:16:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:55,803 INFO L93 Difference]: Finished difference Result 5181 states and 5325 transitions. [2021-01-06 14:16:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 14:16:55,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1722 [2021-01-06 14:16:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:55,813 INFO L225 Difference]: With dead ends: 5181 [2021-01-06 14:16:55,813 INFO L226 Difference]: Without dead ends: 4988 [2021-01-06 14:16:55,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:16:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2021-01-06 14:16:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4454. [2021-01-06 14:16:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2021-01-06 14:16:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4581 transitions. [2021-01-06 14:16:55,876 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4581 transitions. Word has length 1722 [2021-01-06 14:16:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:55,878 INFO L481 AbstractCegarLoop]: Abstraction has 4454 states and 4581 transitions. [2021-01-06 14:16:55,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 14:16:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4581 transitions. [2021-01-06 14:16:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1728 [2021-01-06 14:16:55,907 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:55,908 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:55,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 14:16:55,909 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1097919814, now seen corresponding path program 1 times [2021-01-06 14:16:55,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:55,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931317060] [2021-01-06 14:16:55,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9684 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 9181 trivial. 0 not checked. [2021-01-06 14:16:59,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931317060] [2021-01-06 14:16:59,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:59,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:59,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719278291] [2021-01-06 14:16:59,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:59,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:59,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:59,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:59,327 INFO L87 Difference]: Start difference. First operand 4454 states and 4581 transitions. Second operand 4 states. [2021-01-06 14:16:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:59,993 INFO L93 Difference]: Finished difference Result 4646 states and 4773 transitions. [2021-01-06 14:16:59,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:59,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1727 [2021-01-06 14:16:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:00,004 INFO L225 Difference]: With dead ends: 4646 [2021-01-06 14:17:00,005 INFO L226 Difference]: Without dead ends: 4454 [2021-01-06 14:17:00,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2021-01-06 14:17:00,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2021-01-06 14:17:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2021-01-06 14:17:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4577 transitions. [2021-01-06 14:17:00,068 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4577 transitions. Word has length 1727 [2021-01-06 14:17:00,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:00,070 INFO L481 AbstractCegarLoop]: Abstraction has 4454 states and 4577 transitions. [2021-01-06 14:17:00,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:00,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4577 transitions. [2021-01-06 14:17:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1728 [2021-01-06 14:17:00,100 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:00,101 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:00,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 14:17:00,102 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:00,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:00,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1415086703, now seen corresponding path program 1 times [2021-01-06 14:17:00,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:00,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919213233] [2021-01-06 14:17:00,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9651 backedges. 6507 proven. 0 refuted. 0 times theorem prover too weak. 3144 trivial. 0 not checked. [2021-01-06 14:17:03,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919213233] [2021-01-06 14:17:03,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:03,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 14:17:03,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046287593] [2021-01-06 14:17:03,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:03,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:03,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:03,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:03,014 INFO L87 Difference]: Start difference. First operand 4454 states and 4577 transitions. Second operand 4 states. [2021-01-06 14:17:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:04,019 INFO L93 Difference]: Finished difference Result 8728 states and 8973 transitions. [2021-01-06 14:17:04,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:04,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1727 [2021-01-06 14:17:04,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:04,028 INFO L225 Difference]: With dead ends: 8728 [2021-01-06 14:17:04,028 INFO L226 Difference]: Without dead ends: 4454 [2021-01-06 14:17:04,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2021-01-06 14:17:04,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2021-01-06 14:17:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2021-01-06 14:17:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4535 transitions. [2021-01-06 14:17:04,089 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4535 transitions. Word has length 1727 [2021-01-06 14:17:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:04,090 INFO L481 AbstractCegarLoop]: Abstraction has 4454 states and 4535 transitions. [2021-01-06 14:17:04,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4535 transitions. [2021-01-06 14:17:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2025 [2021-01-06 14:17:04,126 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:04,127 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:04,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 14:17:04,128 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:04,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:04,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1727252823, now seen corresponding path program 1 times [2021-01-06 14:17:04,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:04,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789496994] [2021-01-06 14:17:04,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 13033 backedges. 1789 proven. 0 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2021-01-06 14:17:07,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789496994] [2021-01-06 14:17:07,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:07,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 14:17:07,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509293181] [2021-01-06 14:17:07,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:07,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:07,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:07,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:07,472 INFO L87 Difference]: Start difference. First operand 4454 states and 4535 transitions. Second operand 4 states. [2021-01-06 14:17:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:08,196 INFO L93 Difference]: Finished difference Result 4467 states and 4548 transitions. [2021-01-06 14:17:08,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:08,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2024 [2021-01-06 14:17:08,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:08,198 INFO L225 Difference]: With dead ends: 4467 [2021-01-06 14:17:08,198 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 14:17:08,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 14:17:08,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 14:17:08,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 14:17:08,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 14:17:08,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2024 [2021-01-06 14:17:08,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:08,203 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 14:17:08,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:08,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 14:17:08,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 14:17:08,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 14:17:08,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 14:17:08,347 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 114 [2021-01-06 14:17:08,935 WARN L197 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2021-01-06 14:17:09,432 WARN L197 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2021-01-06 14:17:09,437 INFO L189 CegarLoopUtils]: For program point L762(lines 762 880) no Hoare annotation was computed. [2021-01-06 14:17:09,437 INFO L189 CegarLoopUtils]: For program point L895(line 895) no Hoare annotation was computed. [2021-01-06 14:17:09,437 INFO L189 CegarLoopUtils]: For program point L829(lines 829 880) no Hoare annotation was computed. [2021-01-06 14:17:09,437 INFO L189 CegarLoopUtils]: For program point L631(lines 631 880) no Hoare annotation was computed. [2021-01-06 14:17:09,437 INFO L189 CegarLoopUtils]: For program point L565(lines 565 880) no Hoare annotation was computed. [2021-01-06 14:17:09,437 INFO L189 CegarLoopUtils]: For program point L169-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,438 INFO L189 CegarLoopUtils]: For program point L103-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,438 INFO L189 CegarLoopUtils]: For program point L37-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,438 INFO L189 CegarLoopUtils]: For program point L698(lines 698 880) no Hoare annotation was computed. [2021-01-06 14:17:09,438 INFO L189 CegarLoopUtils]: For program point L500(lines 500 880) no Hoare annotation was computed. [2021-01-06 14:17:09,438 INFO L189 CegarLoopUtils]: For program point L170(line 170) no Hoare annotation was computed. [2021-01-06 14:17:09,438 INFO L189 CegarLoopUtils]: For program point L104(line 104) no Hoare annotation was computed. [2021-01-06 14:17:09,438 INFO L189 CegarLoopUtils]: For program point L38(line 38) no Hoare annotation was computed. [2021-01-06 14:17:09,438 INFO L189 CegarLoopUtils]: For program point L369(lines 369 880) no Hoare annotation was computed. [2021-01-06 14:17:09,438 INFO L189 CegarLoopUtils]: For program point L303(lines 303 880) no Hoare annotation was computed. [2021-01-06 14:17:09,438 INFO L189 CegarLoopUtils]: For program point L436(lines 436 880) no Hoare annotation was computed. [2021-01-06 14:17:09,438 INFO L189 CegarLoopUtils]: For program point L172-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,439 INFO L189 CegarLoopUtils]: For program point L106-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,439 INFO L189 CegarLoopUtils]: For program point L40-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,439 INFO L189 CegarLoopUtils]: For program point L239(lines 239 880) no Hoare annotation was computed. [2021-01-06 14:17:09,439 INFO L189 CegarLoopUtils]: For program point L173(line 173) no Hoare annotation was computed. [2021-01-06 14:17:09,439 INFO L189 CegarLoopUtils]: For program point L107(line 107) no Hoare annotation was computed. [2021-01-06 14:17:09,439 INFO L189 CegarLoopUtils]: For program point L41(line 41) no Hoare annotation was computed. [2021-01-06 14:17:09,439 INFO L189 CegarLoopUtils]: For program point L768(lines 768 880) no Hoare annotation was computed. [2021-01-06 14:17:09,439 INFO L189 CegarLoopUtils]: For program point L636(lines 636 880) no Hoare annotation was computed. [2021-01-06 14:17:09,439 INFO L189 CegarLoopUtils]: For program point L835(lines 835 880) no Hoare annotation was computed. [2021-01-06 14:17:09,439 INFO L189 CegarLoopUtils]: For program point L571(lines 571 880) no Hoare annotation was computed. [2021-01-06 14:17:09,439 INFO L189 CegarLoopUtils]: For program point L505(lines 505 880) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L175-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L109-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L43-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L704(lines 704 880) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L176(line 176) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L110(line 110) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L44(line 44) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L309(lines 309 880) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L442(lines 442 880) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L376(lines 376 880) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L178-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L112-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L46-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L245(lines 245 880) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L179(line 179) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L113(line 113) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L47(line 47) no Hoare annotation was computed. [2021-01-06 14:17:09,440 INFO L189 CegarLoopUtils]: For program point L774(lines 774 880) no Hoare annotation was computed. [2021-01-06 14:17:09,441 INFO L189 CegarLoopUtils]: For program point L642(lines 642 880) no Hoare annotation was computed. [2021-01-06 14:17:09,441 INFO L189 CegarLoopUtils]: For program point L510(lines 510 880) no Hoare annotation was computed. [2021-01-06 14:17:09,441 INFO L189 CegarLoopUtils]: For program point L841(lines 841 880) no Hoare annotation was computed. [2021-01-06 14:17:09,441 INFO L189 CegarLoopUtils]: For program point L181-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,441 INFO L189 CegarLoopUtils]: For program point L115-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,441 INFO L189 CegarLoopUtils]: For program point L49-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,441 INFO L189 CegarLoopUtils]: For program point L710(lines 710 880) no Hoare annotation was computed. [2021-01-06 14:17:09,441 INFO L189 CegarLoopUtils]: For program point L578(lines 578 880) no Hoare annotation was computed. [2021-01-06 14:17:09,441 INFO L189 CegarLoopUtils]: For program point L182(line 182) no Hoare annotation was computed. [2021-01-06 14:17:09,441 INFO L189 CegarLoopUtils]: For program point L116(line 116) no Hoare annotation was computed. [2021-01-06 14:17:09,442 INFO L189 CegarLoopUtils]: For program point L50(line 50) no Hoare annotation was computed. [2021-01-06 14:17:09,442 INFO L189 CegarLoopUtils]: For program point L315(lines 315 880) no Hoare annotation was computed. [2021-01-06 14:17:09,442 INFO L189 CegarLoopUtils]: For program point L448(lines 448 880) no Hoare annotation was computed. [2021-01-06 14:17:09,442 INFO L189 CegarLoopUtils]: For program point L382(lines 382 880) no Hoare annotation was computed. [2021-01-06 14:17:09,442 INFO L189 CegarLoopUtils]: For program point L184-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,442 INFO L189 CegarLoopUtils]: For program point L118-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,442 INFO L189 CegarLoopUtils]: For program point L52-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,442 INFO L189 CegarLoopUtils]: For program point L251(lines 251 880) no Hoare annotation was computed. [2021-01-06 14:17:09,442 INFO L189 CegarLoopUtils]: For program point L185(line 185) no Hoare annotation was computed. [2021-01-06 14:17:09,442 INFO L189 CegarLoopUtils]: For program point L119(line 119) no Hoare annotation was computed. [2021-01-06 14:17:09,442 INFO L189 CegarLoopUtils]: For program point L53(line 53) no Hoare annotation was computed. [2021-01-06 14:17:09,443 INFO L189 CegarLoopUtils]: For program point L648(lines 648 880) no Hoare annotation was computed. [2021-01-06 14:17:09,443 INFO L189 CegarLoopUtils]: For program point L516(lines 516 880) no Hoare annotation was computed. [2021-01-06 14:17:09,443 INFO L189 CegarLoopUtils]: For program point L847(lines 847 880) no Hoare annotation was computed. [2021-01-06 14:17:09,443 INFO L189 CegarLoopUtils]: For program point L781(lines 781 880) no Hoare annotation was computed. [2021-01-06 14:17:09,443 INFO L189 CegarLoopUtils]: For program point L583(lines 583 880) no Hoare annotation was computed. [2021-01-06 14:17:09,443 INFO L189 CegarLoopUtils]: For program point L187-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,443 INFO L189 CegarLoopUtils]: For program point L121-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,443 INFO L189 CegarLoopUtils]: For program point L55-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,443 INFO L189 CegarLoopUtils]: For program point L716(lines 716 880) no Hoare annotation was computed. [2021-01-06 14:17:09,443 INFO L189 CegarLoopUtils]: For program point L188(line 188) no Hoare annotation was computed. [2021-01-06 14:17:09,443 INFO L189 CegarLoopUtils]: For program point L122(line 122) no Hoare annotation was computed. [2021-01-06 14:17:09,444 INFO L189 CegarLoopUtils]: For program point L56(line 56) no Hoare annotation was computed. [2021-01-06 14:17:09,444 INFO L189 CegarLoopUtils]: For program point L321(lines 321 880) no Hoare annotation was computed. [2021-01-06 14:17:09,444 INFO L189 CegarLoopUtils]: For program point L454(lines 454 880) no Hoare annotation was computed. [2021-01-06 14:17:09,444 INFO L189 CegarLoopUtils]: For program point L388(lines 388 880) no Hoare annotation was computed. [2021-01-06 14:17:09,444 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 14:17:09,444 INFO L189 CegarLoopUtils]: For program point L190-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,444 INFO L189 CegarLoopUtils]: For program point L124-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,444 INFO L189 CegarLoopUtils]: For program point L58-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,444 INFO L189 CegarLoopUtils]: For program point L257(lines 257 880) no Hoare annotation was computed. [2021-01-06 14:17:09,444 INFO L189 CegarLoopUtils]: For program point L191(line 191) no Hoare annotation was computed. [2021-01-06 14:17:09,444 INFO L189 CegarLoopUtils]: For program point L125(line 125) no Hoare annotation was computed. [2021-01-06 14:17:09,444 INFO L189 CegarLoopUtils]: For program point L59(line 59) no Hoare annotation was computed. [2021-01-06 14:17:09,445 INFO L189 CegarLoopUtils]: For program point L852(lines 852 880) no Hoare annotation was computed. [2021-01-06 14:17:09,445 INFO L189 CegarLoopUtils]: For program point L654(lines 654 880) no Hoare annotation was computed. [2021-01-06 14:17:09,445 INFO L189 CegarLoopUtils]: For program point L522(lines 522 880) no Hoare annotation was computed. [2021-01-06 14:17:09,445 INFO L189 CegarLoopUtils]: For program point L787(lines 787 880) no Hoare annotation was computed. [2021-01-06 14:17:09,445 INFO L189 CegarLoopUtils]: For program point L589(lines 589 880) no Hoare annotation was computed. [2021-01-06 14:17:09,445 INFO L189 CegarLoopUtils]: For program point L193-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,445 INFO L189 CegarLoopUtils]: For program point L127-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,445 INFO L189 CegarLoopUtils]: For program point L61-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,445 INFO L189 CegarLoopUtils]: For program point L722(lines 722 880) no Hoare annotation was computed. [2021-01-06 14:17:09,445 INFO L189 CegarLoopUtils]: For program point L194(line 194) no Hoare annotation was computed. [2021-01-06 14:17:09,445 INFO L189 CegarLoopUtils]: For program point L128(line 128) no Hoare annotation was computed. [2021-01-06 14:17:09,446 INFO L189 CegarLoopUtils]: For program point L62(line 62) no Hoare annotation was computed. [2021-01-06 14:17:09,446 INFO L189 CegarLoopUtils]: For program point L459(lines 459 880) no Hoare annotation was computed. [2021-01-06 14:17:09,446 INFO L189 CegarLoopUtils]: For program point L327(lines 327 880) no Hoare annotation was computed. [2021-01-06 14:17:09,446 INFO L189 CegarLoopUtils]: For program point L394(lines 394 880) no Hoare annotation was computed. [2021-01-06 14:17:09,446 INFO L189 CegarLoopUtils]: For program point L262(lines 262 880) no Hoare annotation was computed. [2021-01-06 14:17:09,446 INFO L189 CegarLoopUtils]: For program point L196-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,446 INFO L189 CegarLoopUtils]: For program point L130-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,446 INFO L189 CegarLoopUtils]: For program point L64-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,446 INFO L189 CegarLoopUtils]: For program point L197(line 197) no Hoare annotation was computed. [2021-01-06 14:17:09,446 INFO L189 CegarLoopUtils]: For program point L131(line 131) no Hoare annotation was computed. [2021-01-06 14:17:09,446 INFO L189 CegarLoopUtils]: For program point L65(line 65) no Hoare annotation was computed. [2021-01-06 14:17:09,446 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 14:17:09,447 INFO L189 CegarLoopUtils]: For program point L858(lines 858 880) no Hoare annotation was computed. [2021-01-06 14:17:09,447 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 128) no Hoare annotation was computed. [2021-01-06 14:17:09,447 INFO L189 CegarLoopUtils]: For program point L660(lines 660 880) no Hoare annotation was computed. [2021-01-06 14:17:09,447 INFO L189 CegarLoopUtils]: For program point L528(lines 528 880) no Hoare annotation was computed. [2021-01-06 14:17:09,447 INFO L189 CegarLoopUtils]: For program point L793(lines 793 880) no Hoare annotation was computed. [2021-01-06 14:17:09,447 INFO L189 CegarLoopUtils]: For program point L595(lines 595 880) no Hoare annotation was computed. [2021-01-06 14:17:09,447 INFO L189 CegarLoopUtils]: For program point L199-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,447 INFO L189 CegarLoopUtils]: For program point L133-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,447 INFO L189 CegarLoopUtils]: For program point L67-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,447 INFO L189 CegarLoopUtils]: For program point L728(lines 728 880) no Hoare annotation was computed. [2021-01-06 14:17:09,448 INFO L189 CegarLoopUtils]: For program point L464(lines 464 880) no Hoare annotation was computed. [2021-01-06 14:17:09,448 INFO L189 CegarLoopUtils]: For program point L200(line 200) no Hoare annotation was computed. [2021-01-06 14:17:09,448 INFO L189 CegarLoopUtils]: For program point L134(line 134) no Hoare annotation was computed. [2021-01-06 14:17:09,448 INFO L189 CegarLoopUtils]: For program point L68(line 68) no Hoare annotation was computed. [2021-01-06 14:17:09,448 INFO L189 CegarLoopUtils]: For program point L333(lines 333 880) no Hoare annotation was computed. [2021-01-06 14:17:09,448 INFO L189 CegarLoopUtils]: For program point L400(lines 400 880) no Hoare annotation was computed. [2021-01-06 14:17:09,448 INFO L189 CegarLoopUtils]: For program point L268(lines 268 880) no Hoare annotation was computed. [2021-01-06 14:17:09,448 INFO L189 CegarLoopUtils]: For program point L202-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,448 INFO L189 CegarLoopUtils]: For program point L136-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,448 INFO L189 CegarLoopUtils]: For program point L70-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,448 INFO L189 CegarLoopUtils]: For program point L203(line 203) no Hoare annotation was computed. [2021-01-06 14:17:09,448 INFO L189 CegarLoopUtils]: For program point L137(line 137) no Hoare annotation was computed. [2021-01-06 14:17:09,449 INFO L189 CegarLoopUtils]: For program point L71(line 71) no Hoare annotation was computed. [2021-01-06 14:17:09,449 INFO L189 CegarLoopUtils]: For program point L864(lines 864 880) no Hoare annotation was computed. [2021-01-06 14:17:09,449 INFO L189 CegarLoopUtils]: For program point L666(lines 666 880) no Hoare annotation was computed. [2021-01-06 14:17:09,449 INFO L189 CegarLoopUtils]: For program point L534(lines 534 880) no Hoare annotation was computed. [2021-01-06 14:17:09,449 INFO L189 CegarLoopUtils]: For program point L799(lines 799 880) no Hoare annotation was computed. [2021-01-06 14:17:09,449 INFO L189 CegarLoopUtils]: For program point L601(lines 601 880) no Hoare annotation was computed. [2021-01-06 14:17:09,449 INFO L189 CegarLoopUtils]: For program point L205-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,449 INFO L189 CegarLoopUtils]: For program point L139-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,449 INFO L189 CegarLoopUtils]: For program point L73-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,449 INFO L189 CegarLoopUtils]: For program point L734(lines 734 880) no Hoare annotation was computed. [2021-01-06 14:17:09,449 INFO L189 CegarLoopUtils]: For program point L470(lines 470 880) no Hoare annotation was computed. [2021-01-06 14:17:09,449 INFO L189 CegarLoopUtils]: For program point L206(line 206) no Hoare annotation was computed. [2021-01-06 14:17:09,450 INFO L189 CegarLoopUtils]: For program point L140(line 140) no Hoare annotation was computed. [2021-01-06 14:17:09,450 INFO L189 CegarLoopUtils]: For program point L74(line 74) no Hoare annotation was computed. [2021-01-06 14:17:09,450 INFO L189 CegarLoopUtils]: For program point L339(lines 339 880) no Hoare annotation was computed. [2021-01-06 14:17:09,450 INFO L189 CegarLoopUtils]: For program point L406(lines 406 880) no Hoare annotation was computed. [2021-01-06 14:17:09,450 INFO L189 CegarLoopUtils]: For program point L274(lines 274 880) no Hoare annotation was computed. [2021-01-06 14:17:09,450 INFO L189 CegarLoopUtils]: For program point L208-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,450 INFO L189 CegarLoopUtils]: For program point L142-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,450 INFO L189 CegarLoopUtils]: For program point L76-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,450 INFO L189 CegarLoopUtils]: For program point L869(lines 869 880) no Hoare annotation was computed. [2021-01-06 14:17:09,450 INFO L189 CegarLoopUtils]: For program point L209(line 209) no Hoare annotation was computed. [2021-01-06 14:17:09,450 INFO L189 CegarLoopUtils]: For program point L143(line 143) no Hoare annotation was computed. [2021-01-06 14:17:09,450 INFO L189 CegarLoopUtils]: For program point L77(line 77) no Hoare annotation was computed. [2021-01-06 14:17:09,451 INFO L189 CegarLoopUtils]: For program point L672(lines 672 880) no Hoare annotation was computed. [2021-01-06 14:17:09,451 INFO L189 CegarLoopUtils]: For program point L540(lines 540 880) no Hoare annotation was computed. [2021-01-06 14:17:09,451 INFO L189 CegarLoopUtils]: For program point L805(lines 805 880) no Hoare annotation was computed. [2021-01-06 14:17:09,451 INFO L189 CegarLoopUtils]: For program point L607(lines 607 880) no Hoare annotation was computed. [2021-01-06 14:17:09,451 INFO L189 CegarLoopUtils]: For program point L211-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,451 INFO L189 CegarLoopUtils]: For program point L145-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,451 INFO L189 CegarLoopUtils]: For program point L79-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,451 INFO L189 CegarLoopUtils]: For program point L740(lines 740 880) no Hoare annotation was computed. [2021-01-06 14:17:09,451 INFO L189 CegarLoopUtils]: For program point L212(line 212) no Hoare annotation was computed. [2021-01-06 14:17:09,451 INFO L189 CegarLoopUtils]: For program point L146(line 146) no Hoare annotation was computed. [2021-01-06 14:17:09,451 INFO L189 CegarLoopUtils]: For program point L80(line 80) no Hoare annotation was computed. [2021-01-06 14:17:09,451 INFO L189 CegarLoopUtils]: For program point L477(lines 477 880) no Hoare annotation was computed. [2021-01-06 14:17:09,452 INFO L189 CegarLoopUtils]: For program point L345(lines 345 880) no Hoare annotation was computed. [2021-01-06 14:17:09,452 INFO L189 CegarLoopUtils]: For program point L279(lines 279 880) no Hoare annotation was computed. [2021-01-06 14:17:09,452 INFO L189 CegarLoopUtils]: For program point L412(lines 412 880) no Hoare annotation was computed. [2021-01-06 14:17:09,452 INFO L189 CegarLoopUtils]: For program point L148-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,452 INFO L189 CegarLoopUtils]: For program point L82-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,452 INFO L189 CegarLoopUtils]: For program point L875(lines 875 880) no Hoare annotation was computed. [2021-01-06 14:17:09,452 INFO L189 CegarLoopUtils]: For program point L149(line 149) no Hoare annotation was computed. [2021-01-06 14:17:09,452 INFO L189 CegarLoopUtils]: For program point L83(line 83) no Hoare annotation was computed. [2021-01-06 14:17:09,452 INFO L189 CegarLoopUtils]: For program point L678(lines 678 880) no Hoare annotation was computed. [2021-01-06 14:17:09,452 INFO L189 CegarLoopUtils]: For program point L546(lines 546 880) no Hoare annotation was computed. [2021-01-06 14:17:09,452 INFO L189 CegarLoopUtils]: For program point L811(lines 811 880) no Hoare annotation was computed. [2021-01-06 14:17:09,452 INFO L189 CegarLoopUtils]: For program point L745(lines 745 880) no Hoare annotation was computed. [2021-01-06 14:17:09,453 INFO L189 CegarLoopUtils]: For program point L613(lines 613 880) no Hoare annotation was computed. [2021-01-06 14:17:09,453 INFO L189 CegarLoopUtils]: For program point L151-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,453 INFO L189 CegarLoopUtils]: For program point L85-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,453 INFO L189 CegarLoopUtils]: For program point L482(lines 482 880) no Hoare annotation was computed. [2021-01-06 14:17:09,453 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 14:17:09,453 INFO L189 CegarLoopUtils]: For program point L152(line 152) no Hoare annotation was computed. [2021-01-06 14:17:09,453 INFO L189 CegarLoopUtils]: For program point L86(line 86) no Hoare annotation was computed. [2021-01-06 14:17:09,453 INFO L189 CegarLoopUtils]: For program point L351(lines 351 880) no Hoare annotation was computed. [2021-01-06 14:17:09,453 INFO L189 CegarLoopUtils]: For program point L285(lines 285 880) no Hoare annotation was computed. [2021-01-06 14:17:09,453 INFO L189 CegarLoopUtils]: For program point L418(lines 418 880) no Hoare annotation was computed. [2021-01-06 14:17:09,453 INFO L189 CegarLoopUtils]: For program point L154-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,453 INFO L189 CegarLoopUtils]: For program point L88-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,454 INFO L185 CegarLoopUtils]: At program point L881(lines 30 882) the Hoare annotation is: (let ((.cse4 (not (= 7 ~a15~0))) (.cse1 (<= ~a21~0 6)) (.cse3 (<= ~a12~0 599999)) (.cse2 (<= ~a15~0 7)) (.cse5 (<= ~a21~0 9)) (.cse6 (+ ~a12~0 43)) (.cse0 (= ~a24~0 1)) (.cse7 (<= ~a21~0 8))) (or (and (<= ~a12~0 586307) .cse0 .cse1) (and .cse2 (= ~a21~0 10) (< 80 ~a12~0) .cse0) (and .cse0 (<= 10 ~a21~0) .cse3 .cse4) (and .cse2 .cse0 .cse4) (and (<= 9 ~a21~0) .cse0 .cse5 (<= ~a12~0 76)) (and (<= (+ ~a12~0 49) 0) .cse0) (and .cse2 (<= .cse6 0) .cse1) (and (<= 8 ~a21~0) .cse0 (<= ~a12~0 73282) .cse7) (and (<= 7 ~a21~0) .cse0 (<= 9 ~a15~0) .cse3) (and .cse2 .cse0 .cse5) (and (< 0 .cse6) (<= ~a12~0 11) .cse0 .cse7))) [2021-01-06 14:17:09,454 INFO L189 CegarLoopUtils]: For program point L551(lines 551 880) no Hoare annotation was computed. [2021-01-06 14:17:09,454 INFO L189 CegarLoopUtils]: For program point L221(lines 221 880) no Hoare annotation was computed. [2021-01-06 14:17:09,454 INFO L189 CegarLoopUtils]: For program point L155(line 155) no Hoare annotation was computed. [2021-01-06 14:17:09,454 INFO L189 CegarLoopUtils]: For program point L89(line 89) no Hoare annotation was computed. [2021-01-06 14:17:09,454 INFO L189 CegarLoopUtils]: For program point L684(lines 684 880) no Hoare annotation was computed. [2021-01-06 14:17:09,454 INFO L189 CegarLoopUtils]: For program point L817(lines 817 880) no Hoare annotation was computed. [2021-01-06 14:17:09,455 INFO L189 CegarLoopUtils]: For program point L751(lines 751 880) no Hoare annotation was computed. [2021-01-06 14:17:09,455 INFO L189 CegarLoopUtils]: For program point L619(lines 619 880) no Hoare annotation was computed. [2021-01-06 14:17:09,455 INFO L189 CegarLoopUtils]: For program point L157-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,455 INFO L189 CegarLoopUtils]: For program point L91-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,455 INFO L192 CegarLoopUtils]: At program point L884(lines 884 900) the Hoare annotation is: true [2021-01-06 14:17:09,455 INFO L189 CegarLoopUtils]: For program point L488(lines 488 880) no Hoare annotation was computed. [2021-01-06 14:17:09,455 INFO L189 CegarLoopUtils]: For program point L290(lines 290 880) no Hoare annotation was computed. [2021-01-06 14:17:09,455 INFO L189 CegarLoopUtils]: For program point L158(line 158) no Hoare annotation was computed. [2021-01-06 14:17:09,455 INFO L189 CegarLoopUtils]: For program point L92(line 92) no Hoare annotation was computed. [2021-01-06 14:17:09,456 INFO L189 CegarLoopUtils]: For program point L687(lines 687 880) no Hoare annotation was computed. [2021-01-06 14:17:09,456 INFO L189 CegarLoopUtils]: For program point L357(lines 357 880) no Hoare annotation was computed. [2021-01-06 14:17:09,456 INFO L189 CegarLoopUtils]: For program point L424(lines 424 880) no Hoare annotation was computed. [2021-01-06 14:17:09,456 INFO L189 CegarLoopUtils]: For program point L160-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,456 INFO L189 CegarLoopUtils]: For program point L94-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,456 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 14:17:09,456 INFO L189 CegarLoopUtils]: For program point L557(lines 557 880) no Hoare annotation was computed. [2021-01-06 14:17:09,456 INFO L189 CegarLoopUtils]: For program point L227(lines 227 880) no Hoare annotation was computed. [2021-01-06 14:17:09,456 INFO L189 CegarLoopUtils]: For program point L161(line 161) no Hoare annotation was computed. [2021-01-06 14:17:09,456 INFO L189 CegarLoopUtils]: For program point L95(line 95) no Hoare annotation was computed. [2021-01-06 14:17:09,456 INFO L189 CegarLoopUtils]: For program point L757(lines 757 880) no Hoare annotation was computed. [2021-01-06 14:17:09,456 INFO L189 CegarLoopUtils]: For program point L625(lines 625 880) no Hoare annotation was computed. [2021-01-06 14:17:09,456 INFO L189 CegarLoopUtils]: For program point L163-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,457 INFO L189 CegarLoopUtils]: For program point L97-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,457 INFO L189 CegarLoopUtils]: For program point L31(lines 31 33) no Hoare annotation was computed. [2021-01-06 14:17:09,457 INFO L189 CegarLoopUtils]: For program point L31-2(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,457 INFO L189 CegarLoopUtils]: For program point L824(lines 824 880) no Hoare annotation was computed. [2021-01-06 14:17:09,457 INFO L185 CegarLoopUtils]: At program point L890-2(lines 890 899) the Hoare annotation is: (let ((.cse4 (not (= 7 ~a15~0))) (.cse1 (<= ~a21~0 6)) (.cse3 (<= ~a12~0 599999)) (.cse2 (<= ~a15~0 7)) (.cse5 (<= ~a21~0 9)) (.cse6 (+ ~a12~0 43)) (.cse0 (= ~a24~0 1)) (.cse7 (<= ~a21~0 8))) (or (and (<= ~a12~0 586307) .cse0 .cse1) (and .cse2 (= ~a21~0 10) (< 80 ~a12~0) .cse0) (and .cse0 (<= 10 ~a21~0) .cse3 .cse4) (and .cse2 .cse0 .cse4) (and (<= 9 ~a21~0) .cse0 .cse5 (<= ~a12~0 76)) (and (<= (+ ~a12~0 49) 0) .cse0) (and .cse2 (<= .cse6 0) .cse1) (and (<= 8 ~a21~0) .cse0 (<= ~a12~0 73282) .cse7) (and (<= 7 ~a21~0) .cse0 (<= 9 ~a15~0) .cse3) (and .cse2 .cse0 .cse5) (and (< 0 .cse6) (<= ~a12~0 11) .cse0 .cse7))) [2021-01-06 14:17:09,457 INFO L189 CegarLoopUtils]: For program point L494(lines 494 880) no Hoare annotation was computed. [2021-01-06 14:17:09,457 INFO L189 CegarLoopUtils]: For program point L296(lines 296 880) no Hoare annotation was computed. [2021-01-06 14:17:09,457 INFO L189 CegarLoopUtils]: For program point L164(line 164) no Hoare annotation was computed. [2021-01-06 14:17:09,457 INFO L189 CegarLoopUtils]: For program point L98(line 98) no Hoare annotation was computed. [2021-01-06 14:17:09,457 INFO L189 CegarLoopUtils]: For program point L32(line 32) no Hoare annotation was computed. [2021-01-06 14:17:09,458 INFO L189 CegarLoopUtils]: For program point L693(lines 693 880) no Hoare annotation was computed. [2021-01-06 14:17:09,458 INFO L189 CegarLoopUtils]: For program point L363(lines 363 880) no Hoare annotation was computed. [2021-01-06 14:17:09,458 INFO L189 CegarLoopUtils]: For program point L562(lines 562 880) no Hoare annotation was computed. [2021-01-06 14:17:09,458 INFO L189 CegarLoopUtils]: For program point L430(lines 430 880) no Hoare annotation was computed. [2021-01-06 14:17:09,458 INFO L189 CegarLoopUtils]: For program point L166-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,458 INFO L189 CegarLoopUtils]: For program point L100-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,458 INFO L189 CegarLoopUtils]: For program point L34-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:09,458 INFO L189 CegarLoopUtils]: For program point L233(lines 233 880) no Hoare annotation was computed. [2021-01-06 14:17:09,458 INFO L189 CegarLoopUtils]: For program point L167(line 167) no Hoare annotation was computed. [2021-01-06 14:17:09,458 INFO L189 CegarLoopUtils]: For program point L101(line 101) no Hoare annotation was computed. [2021-01-06 14:17:09,458 INFO L189 CegarLoopUtils]: For program point L35(line 35) no Hoare annotation was computed. [2021-01-06 14:17:09,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 02:17:09 BoogieIcfgContainer [2021-01-06 14:17:09,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 14:17:09,488 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 14:17:09,488 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 14:17:09,488 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 14:17:09,489 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:15:56" (3/4) ... [2021-01-06 14:17:09,492 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 14:17:09,521 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-01-06 14:17:09,523 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 14:17:09,524 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 14:17:09,526 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 14:17:09,707 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem14_label48.c-witness.graphml [2021-01-06 14:17:09,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 14:17:09,709 INFO L168 Benchmark]: Toolchain (without parser) took 76468.76 ms. Allocated memory was 164.6 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 138.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 169.9 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:09,709 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 164.6 MB. Free memory is still 139.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 14:17:09,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 891.64 ms. Allocated memory is still 164.6 MB. Free memory was 137.8 MB in the beginning and 105.4 MB in the end (delta: 32.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:09,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.38 ms. Allocated memory is still 164.6 MB. Free memory was 105.4 MB in the beginning and 95.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:09,710 INFO L168 Benchmark]: Boogie Preprocessor took 216.95 ms. Allocated memory is still 164.6 MB. Free memory was 95.9 MB in the beginning and 139.9 MB in the end (delta: -44.0 MB). Peak memory consumption was 12.3 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:09,711 INFO L168 Benchmark]: RCFGBuilder took 1882.91 ms. Allocated memory was 164.6 MB in the beginning and 228.6 MB in the end (delta: 64.0 MB). Free memory was 139.6 MB in the beginning and 165.6 MB in the end (delta: -26.0 MB). Peak memory consumption was 97.3 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:09,711 INFO L168 Benchmark]: TraceAbstraction took 73079.41 ms. Allocated memory was 228.6 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 165.6 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. [2021-01-06 14:17:09,712 INFO L168 Benchmark]: Witness Printer took 219.55 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:09,715 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 164.6 MB. Free memory is still 139.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 891.64 ms. Allocated memory is still 164.6 MB. Free memory was 137.8 MB in the beginning and 105.4 MB in the end (delta: 32.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 168.38 ms. Allocated memory is still 164.6 MB. Free memory was 105.4 MB in the beginning and 95.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 216.95 ms. Allocated memory is still 164.6 MB. Free memory was 95.9 MB in the beginning and 139.9 MB in the end (delta: -44.0 MB). Peak memory consumption was 12.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1882.91 ms. Allocated memory was 164.6 MB in the beginning and 228.6 MB in the end (delta: 64.0 MB). Free memory was 139.6 MB in the beginning and 165.6 MB in the end (delta: -26.0 MB). Peak memory consumption was 97.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 73079.41 ms. Allocated memory was 228.6 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 165.6 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. * Witness Printer took 219.55 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 128]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((((((((((a12 <= 586307 && a24 == 1) && a21 <= 6) || (((a15 <= 7 && a21 == 10) && 80 < a12) && a24 == 1)) || (((a24 == 1 && 10 <= a21) && a12 <= 599999) && !(7 == a15))) || ((a15 <= 7 && a24 == 1) && !(7 == a15))) || (((9 <= a21 && a24 == 1) && a21 <= 9) && a12 <= 76)) || (a12 + 49 <= 0 && a24 == 1)) || ((a15 <= 7 && a12 + 43 <= 0) && a21 <= 6)) || (((8 <= a21 && a24 == 1) && a12 <= 73282) && a21 <= 8)) || (((7 <= a21 && a24 == 1) && 9 <= a15) && a12 <= 599999)) || ((a15 <= 7 && a24 == 1) && a21 <= 9)) || (((0 < a12 + 43 && a12 <= 11) && a24 == 1) && a21 <= 8) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((a12 <= 586307 && a24 == 1) && a21 <= 6) || (((a15 <= 7 && a21 == 10) && 80 < a12) && a24 == 1)) || (((a24 == 1 && 10 <= a21) && a12 <= 599999) && !(7 == a15))) || ((a15 <= 7 && a24 == 1) && !(7 == a15))) || (((9 <= a21 && a24 == 1) && a21 <= 9) && a12 <= 76)) || (a12 + 49 <= 0 && a24 == 1)) || ((a15 <= 7 && a12 + 43 <= 0) && a21 <= 6)) || (((8 <= a21 && a24 == 1) && a12 <= 73282) && a21 <= 8)) || (((7 <= a21 && a24 == 1) && 9 <= a15) && a12 <= 599999)) || ((a15 <= 7 && a24 == 1) && a21 <= 9)) || (((0 < a12 + 43 && a12 <= 11) && a24 == 1) && a21 <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 71.7s, OverallIterations: 23, TraceHistogramMax: 17, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2218 SDtfs, 2504 SDslu, 155 SDs, 0 SdLazy, 13420 SolverSat, 1702 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7133 GetRequests, 7068 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5344occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 3589 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 98 NumberOfFragments, 269 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3488 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1806 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 26755 NumberOfCodeBlocks, 26755 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 26723 ConstructedInterpolants, 0 QuantifiedInterpolants, 77658429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 8987 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 32 InterpolantComputations, 22 PerfectInterpolantSequences, 94030/96306 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 correct! Received shutdown request...