/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_label46.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 04:21:22,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 04:21:22,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 04:21:22,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 04:21:22,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 04:21:22,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 04:21:22,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 04:21:22,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 04:21:22,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 04:21:22,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 04:21:22,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 04:21:22,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 04:21:22,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 04:21:22,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 04:21:22,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 04:21:22,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 04:21:22,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 04:21:22,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 04:21:22,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 04:21:22,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 04:21:22,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 04:21:22,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 04:21:22,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 04:21:22,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 04:21:22,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 04:21:22,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 04:21:22,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 04:21:22,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 04:21:22,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 04:21:22,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 04:21:22,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 04:21:22,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 04:21:22,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 04:21:22,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 04:21:22,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 04:21:22,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 04:21:22,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 04:21:22,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 04:21:22,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 04:21:22,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 04:21:22,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 04:21:22,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 04:21:22,929 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 04:21:22,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 04:21:22,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 04:21:22,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 04:21:22,932 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 04:21:22,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 04:21:22,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 04:21:22,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 04:21:22,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 04:21:22,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 04:21:22,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 04:21:22,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 04:21:22,934 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 04:21:22,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 04:21:22,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 04:21:22,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 04:21:22,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 04:21:22,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 04:21:22,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 04:21:22,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 04:21:22,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 04:21:22,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 04:21:22,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 04:21:22,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 04:21:22,937 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 04:21:22,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 04:21:23,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 04:21:23,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 04:21:23,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 04:21:23,337 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 04:21:23,338 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 04:21:23,339 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label46.c [2020-12-23 04:21:23,427 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1309e3fc3/576fad50824443a18b573cbcbe34bbb1/FLAG7b4158f13 [2020-12-23 04:21:24,228 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 04:21:24,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label46.c [2020-12-23 04:21:24,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1309e3fc3/576fad50824443a18b573cbcbe34bbb1/FLAG7b4158f13 [2020-12-23 04:21:24,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1309e3fc3/576fad50824443a18b573cbcbe34bbb1 [2020-12-23 04:21:24,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 04:21:24,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 04:21:24,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 04:21:24,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 04:21:24,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 04:21:24,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:21:24" (1/1) ... [2020-12-23 04:21:24,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d39689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:21:24, skipping insertion in model container [2020-12-23 04:21:24,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:21:24" (1/1) ... [2020-12-23 04:21:24,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 04:21:24,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 04:21:24,833 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_label46.c[4146,4159] 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,] [2020-12-23 04:21:25,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 04:21:25,161 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 04:21:25,211 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_label46.c[4146,4159] 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,] [2020-12-23 04:21:25,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 04:21:25,460 INFO L208 MainTranslator]: Completed translation [2020-12-23 04:21:25,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:21:25 WrapperNode [2020-12-23 04:21:25,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 04:21:25,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 04:21:25,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 04:21:25,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 04:21:25,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:21:25" (1/1) ... [2020-12-23 04:21:25,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:21:25" (1/1) ... [2020-12-23 04:21:25,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 04:21:25,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 04:21:25,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 04:21:25,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 04:21:25,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:21:25" (1/1) ... [2020-12-23 04:21:25,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:21:25" (1/1) ... [2020-12-23 04:21:25,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:21:25" (1/1) ... [2020-12-23 04:21:25,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:21:25" (1/1) ... [2020-12-23 04:21:25,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:21:25" (1/1) ... [2020-12-23 04:21:25,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:21:25" (1/1) ... [2020-12-23 04:21:25,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:21:25" (1/1) ... [2020-12-23 04:21:25,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 04:21:25,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 04:21:25,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 04:21:25,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 04:21:25,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:21:25" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 04:21:25,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 04:21:25,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 04:21:25,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 04:21:25,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 04:21:27,557 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 04:21:27,558 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 04:21:27,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:21:27 BoogieIcfgContainer [2020-12-23 04:21:27,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 04:21:27,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 04:21:27,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 04:21:27,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 04:21:27,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 04:21:24" (1/3) ... [2020-12-23 04:21:27,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1cd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:21:27, skipping insertion in model container [2020-12-23 04:21:27,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:21:25" (2/3) ... [2020-12-23 04:21:27,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1cd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:21:27, skipping insertion in model container [2020-12-23 04:21:27,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:21:27" (3/3) ... [2020-12-23 04:21:27,568 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label46.c [2020-12-23 04:21:27,575 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 04:21:27,580 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 04:21:27,599 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 04:21:27,634 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 04:21:27,634 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 04:21:27,669 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 04:21:27,669 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 04:21:27,669 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 04:21:27,670 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 04:21:27,670 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 04:21:27,670 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 04:21:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2020-12-23 04:21:27,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 04:21:27,702 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:27,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:21:27,704 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:27,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1453294289, now seen corresponding path program 1 times [2020-12-23 04:21:27,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:27,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013831151] [2020-12-23 04:21:27,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:21:27,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013831151] [2020-12-23 04:21:27,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:21:27,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 04:21:27,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993743692] [2020-12-23 04:21:27,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:21:27,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:27,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:21:27,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:27,998 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 3 states. [2020-12-23 04:21:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:29,259 INFO L93 Difference]: Finished difference Result 669 states and 1200 transitions. [2020-12-23 04:21:29,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:21:29,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-23 04:21:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:29,278 INFO L225 Difference]: With dead ends: 669 [2020-12-23 04:21:29,278 INFO L226 Difference]: Without dead ends: 360 [2020-12-23 04:21:29,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2020-12-23 04:21:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2020-12-23 04:21:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-12-23 04:21:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2020-12-23 04:21:29,369 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 39 [2020-12-23 04:21:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:29,370 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2020-12-23 04:21:29,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:21:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2020-12-23 04:21:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-23 04:21:29,377 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:29,378 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:21:29,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 04:21:29,379 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:29,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:29,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1422211861, now seen corresponding path program 1 times [2020-12-23 04:21:29,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:29,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899591722] [2020-12-23 04:21:29,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:21:29,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899591722] [2020-12-23 04:21:29,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:21:29,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 04:21:29,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839048215] [2020-12-23 04:21:29,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:21:29,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:29,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:21:29,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:29,635 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand 3 states. [2020-12-23 04:21:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:30,520 INFO L93 Difference]: Finished difference Result 1074 states and 1633 transitions. [2020-12-23 04:21:30,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:21:30,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2020-12-23 04:21:30,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:30,525 INFO L225 Difference]: With dead ends: 1074 [2020-12-23 04:21:30,526 INFO L226 Difference]: Without dead ends: 716 [2020-12-23 04:21:30,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-12-23 04:21:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2020-12-23 04:21:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2020-12-23 04:21:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1011 transitions. [2020-12-23 04:21:30,563 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1011 transitions. Word has length 114 [2020-12-23 04:21:30,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:30,564 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 1011 transitions. [2020-12-23 04:21:30,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:21:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1011 transitions. [2020-12-23 04:21:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 04:21:30,567 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:30,567 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:21:30,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 04:21:30,567 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:30,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:30,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1534152481, now seen corresponding path program 1 times [2020-12-23 04:21:30,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:30,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205160705] [2020-12-23 04:21:30,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:21:30,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205160705] [2020-12-23 04:21:30,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:21:30,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:21:30,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506950848] [2020-12-23 04:21:30,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:21:30,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:30,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:21:30,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:21:30,880 INFO L87 Difference]: Start difference. First operand 716 states and 1011 transitions. Second operand 4 states. [2020-12-23 04:21:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:32,479 INFO L93 Difference]: Finished difference Result 1964 states and 2730 transitions. [2020-12-23 04:21:32,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:21:32,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2020-12-23 04:21:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:32,488 INFO L225 Difference]: With dead ends: 1964 [2020-12-23 04:21:32,488 INFO L226 Difference]: Without dead ends: 1250 [2020-12-23 04:21:32,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 04:21:32,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-12-23 04:21:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1072. [2020-12-23 04:21:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2020-12-23 04:21:32,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1385 transitions. [2020-12-23 04:21:32,529 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1385 transitions. Word has length 118 [2020-12-23 04:21:32,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:32,529 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1385 transitions. [2020-12-23 04:21:32,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:21:32,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1385 transitions. [2020-12-23 04:21:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-12-23 04:21:32,537 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:32,537 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:21:32,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 04:21:32,538 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:32,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:32,538 INFO L82 PathProgramCache]: Analyzing trace with hash 283494956, now seen corresponding path program 1 times [2020-12-23 04:21:32,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:32,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945521292] [2020-12-23 04:21:32,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 04:21:32,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945521292] [2020-12-23 04:21:32,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:21:32,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:21:32,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400403871] [2020-12-23 04:21:32,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:21:32,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:32,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:21:32,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:21:32,868 INFO L87 Difference]: Start difference. First operand 1072 states and 1385 transitions. Second operand 4 states. [2020-12-23 04:21:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:33,959 INFO L93 Difference]: Finished difference Result 2349 states and 3078 transitions. [2020-12-23 04:21:33,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:21:33,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2020-12-23 04:21:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:33,968 INFO L225 Difference]: With dead ends: 2349 [2020-12-23 04:21:33,969 INFO L226 Difference]: Without dead ends: 1428 [2020-12-23 04:21:33,970 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 [2020-12-23 04:21:33,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-12-23 04:21:34,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2020-12-23 04:21:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2020-12-23 04:21:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1620 transitions. [2020-12-23 04:21:34,007 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1620 transitions. Word has length 198 [2020-12-23 04:21:34,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:34,008 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 1620 transitions. [2020-12-23 04:21:34,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:21:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1620 transitions. [2020-12-23 04:21:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2020-12-23 04:21:34,012 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:34,012 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, 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, 2, 2, 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] [2020-12-23 04:21:34,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 04:21:34,013 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:34,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1778373340, now seen corresponding path program 1 times [2020-12-23 04:21:34,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:34,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455254943] [2020-12-23 04:21:34,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-23 04:21:34,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455254943] [2020-12-23 04:21:34,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:21:34,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:21:34,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225577325] [2020-12-23 04:21:34,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:21:34,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:34,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:21:34,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:34,371 INFO L87 Difference]: Start difference. First operand 1428 states and 1620 transitions. Second operand 3 states. [2020-12-23 04:21:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:35,216 INFO L93 Difference]: Finished difference Result 3032 states and 3486 transitions. [2020-12-23 04:21:35,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:21:35,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2020-12-23 04:21:35,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:35,226 INFO L225 Difference]: With dead ends: 3032 [2020-12-23 04:21:35,226 INFO L226 Difference]: Without dead ends: 1784 [2020-12-23 04:21:35,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2020-12-23 04:21:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1784. [2020-12-23 04:21:35,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2020-12-23 04:21:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2015 transitions. [2020-12-23 04:21:35,270 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2015 transitions. Word has length 329 [2020-12-23 04:21:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:35,271 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2015 transitions. [2020-12-23 04:21:35,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:21:35,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2015 transitions. [2020-12-23 04:21:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2020-12-23 04:21:35,278 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:35,279 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2020-12-23 04:21:35,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 04:21:35,279 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:35,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:35,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1391859008, now seen corresponding path program 1 times [2020-12-23 04:21:35,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:35,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009785413] [2020-12-23 04:21:35,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:21:35,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009785413] [2020-12-23 04:21:35,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:21:35,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:21:35,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971526349] [2020-12-23 04:21:35,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:21:35,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:35,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:21:35,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:35,575 INFO L87 Difference]: Start difference. First operand 1784 states and 2015 transitions. Second operand 3 states. [2020-12-23 04:21:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:36,364 INFO L93 Difference]: Finished difference Result 3922 states and 4499 transitions. [2020-12-23 04:21:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:21:36,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 356 [2020-12-23 04:21:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:36,377 INFO L225 Difference]: With dead ends: 3922 [2020-12-23 04:21:36,377 INFO L226 Difference]: Without dead ends: 2318 [2020-12-23 04:21:36,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2020-12-23 04:21:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2020-12-23 04:21:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2020-12-23 04:21:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2604 transitions. [2020-12-23 04:21:36,430 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2604 transitions. Word has length 356 [2020-12-23 04:21:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:36,431 INFO L481 AbstractCegarLoop]: Abstraction has 2318 states and 2604 transitions. [2020-12-23 04:21:36,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:21:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2604 transitions. [2020-12-23 04:21:36,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2020-12-23 04:21:36,439 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:36,439 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:21:36,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 04:21:36,440 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:36,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:36,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1985419495, now seen corresponding path program 1 times [2020-12-23 04:21:36,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:36,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782899991] [2020-12-23 04:21:36,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:21:36,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782899991] [2020-12-23 04:21:36,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:21:36,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:21:36,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230368871] [2020-12-23 04:21:36,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:21:36,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:36,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:21:36,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:36,720 INFO L87 Difference]: Start difference. First operand 2318 states and 2604 transitions. Second operand 3 states. [2020-12-23 04:21:37,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:37,476 INFO L93 Difference]: Finished difference Result 4812 states and 5497 transitions. [2020-12-23 04:21:37,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:21:37,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 363 [2020-12-23 04:21:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:37,489 INFO L225 Difference]: With dead ends: 4812 [2020-12-23 04:21:37,490 INFO L226 Difference]: Without dead ends: 2674 [2020-12-23 04:21:37,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2020-12-23 04:21:37,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2496. [2020-12-23 04:21:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2020-12-23 04:21:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2863 transitions. [2020-12-23 04:21:37,542 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2863 transitions. Word has length 363 [2020-12-23 04:21:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:37,543 INFO L481 AbstractCegarLoop]: Abstraction has 2496 states and 2863 transitions. [2020-12-23 04:21:37,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:21:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2863 transitions. [2020-12-23 04:21:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2020-12-23 04:21:37,553 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:37,553 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:21:37,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 04:21:37,554 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:37,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:37,554 INFO L82 PathProgramCache]: Analyzing trace with hash -709217192, now seen corresponding path program 1 times [2020-12-23 04:21:37,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:37,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892044591] [2020-12-23 04:21:37,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:21:37,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892044591] [2020-12-23 04:21:37,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:21:37,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:21:37,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620148909] [2020-12-23 04:21:37,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:21:37,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:37,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:21:37,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:37,925 INFO L87 Difference]: Start difference. First operand 2496 states and 2863 transitions. Second operand 3 states. [2020-12-23 04:21:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:38,746 INFO L93 Difference]: Finished difference Result 5880 states and 6806 transitions. [2020-12-23 04:21:38,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:21:38,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 435 [2020-12-23 04:21:38,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:38,763 INFO L225 Difference]: With dead ends: 5880 [2020-12-23 04:21:38,764 INFO L226 Difference]: Without dead ends: 3564 [2020-12-23 04:21:38,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2020-12-23 04:21:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2020-12-23 04:21:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2020-12-23 04:21:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 4067 transitions. [2020-12-23 04:21:38,843 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 4067 transitions. Word has length 435 [2020-12-23 04:21:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:38,844 INFO L481 AbstractCegarLoop]: Abstraction has 3564 states and 4067 transitions. [2020-12-23 04:21:38,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:21:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 4067 transitions. [2020-12-23 04:21:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2020-12-23 04:21:38,856 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:38,857 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, 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:21:38,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 04:21:38,858 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash 36660439, now seen corresponding path program 1 times [2020-12-23 04:21:38,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:38,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397353344] [2020-12-23 04:21:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-12-23 04:21:39,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397353344] [2020-12-23 04:21:39,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:21:39,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:21:39,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818944320] [2020-12-23 04:21:39,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:21:39,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:39,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:21:39,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:21:39,533 INFO L87 Difference]: Start difference. First operand 3564 states and 4067 transitions. Second operand 4 states. [2020-12-23 04:21:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:40,411 INFO L93 Difference]: Finished difference Result 7155 states and 8180 transitions. [2020-12-23 04:21:40,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:21:40,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 510 [2020-12-23 04:21:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:40,427 INFO L225 Difference]: With dead ends: 7155 [2020-12-23 04:21:40,428 INFO L226 Difference]: Without dead ends: 3742 [2020-12-23 04:21:40,433 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 [2020-12-23 04:21:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2020-12-23 04:21:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2020-12-23 04:21:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2020-12-23 04:21:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3911 transitions. [2020-12-23 04:21:40,505 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3911 transitions. Word has length 510 [2020-12-23 04:21:40,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:40,505 INFO L481 AbstractCegarLoop]: Abstraction has 3564 states and 3911 transitions. [2020-12-23 04:21:40,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:21:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3911 transitions. [2020-12-23 04:21:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2020-12-23 04:21:40,510 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:40,511 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, 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, 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] [2020-12-23 04:21:40,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 04:21:40,511 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:40,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:40,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1457634709, now seen corresponding path program 1 times [2020-12-23 04:21:40,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:40,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615922921] [2020-12-23 04:21:40,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:21:41,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615922921] [2020-12-23 04:21:41,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:21:41,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 04:21:41,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321690636] [2020-12-23 04:21:41,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:21:41,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:41,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:21:41,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:21:41,163 INFO L87 Difference]: Start difference. First operand 3564 states and 3911 transitions. Second operand 4 states. [2020-12-23 04:21:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:42,339 INFO L93 Difference]: Finished difference Result 9440 states and 10438 transitions. [2020-12-23 04:21:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:21:42,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 518 [2020-12-23 04:21:42,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:42,371 INFO L225 Difference]: With dead ends: 9440 [2020-12-23 04:21:42,371 INFO L226 Difference]: Without dead ends: 6056 [2020-12-23 04:21:42,377 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 [2020-12-23 04:21:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-12-23 04:21:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5878. [2020-12-23 04:21:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2020-12-23 04:21:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6446 transitions. [2020-12-23 04:21:42,551 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6446 transitions. Word has length 518 [2020-12-23 04:21:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:42,552 INFO L481 AbstractCegarLoop]: Abstraction has 5878 states and 6446 transitions. [2020-12-23 04:21:42,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:21:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6446 transitions. [2020-12-23 04:21:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2020-12-23 04:21:42,559 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:42,560 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:21:42,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 04:21:42,560 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:42,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:42,562 INFO L82 PathProgramCache]: Analyzing trace with hash 830156021, now seen corresponding path program 1 times [2020-12-23 04:21:42,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:42,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722019922] [2020-12-23 04:21:42,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-12-23 04:21:43,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722019922] [2020-12-23 04:21:43,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:21:43,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:21:43,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052187034] [2020-12-23 04:21:43,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:21:43,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:43,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:21:43,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:43,007 INFO L87 Difference]: Start difference. First operand 5878 states and 6446 transitions. Second operand 3 states. [2020-12-23 04:21:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:43,760 INFO L93 Difference]: Finished difference Result 11754 states and 12890 transitions. [2020-12-23 04:21:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:21:43,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 572 [2020-12-23 04:21:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:43,786 INFO L225 Difference]: With dead ends: 11754 [2020-12-23 04:21:43,787 INFO L226 Difference]: Without dead ends: 6056 [2020-12-23 04:21:43,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-12-23 04:21:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5878. [2020-12-23 04:21:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2020-12-23 04:21:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6388 transitions. [2020-12-23 04:21:43,927 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6388 transitions. Word has length 572 [2020-12-23 04:21:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:43,928 INFO L481 AbstractCegarLoop]: Abstraction has 5878 states and 6388 transitions. [2020-12-23 04:21:43,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:21:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6388 transitions. [2020-12-23 04:21:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2020-12-23 04:21:43,939 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:43,939 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, 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, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:21:43,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 04:21:43,940 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:43,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:43,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1523966076, now seen corresponding path program 1 times [2020-12-23 04:21:43,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:43,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329612850] [2020-12-23 04:21:43,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:45,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 1185 proven. 104 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-12-23 04:21:45,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329612850] [2020-12-23 04:21:45,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225693579] [2020-12-23 04:21:45,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:21:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:45,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:21:45,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:21:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 1212 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2020-12-23 04:21:46,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:21:46,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2020-12-23 04:21:46,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234783670] [2020-12-23 04:21:46,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:21:46,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:46,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:21:46,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:21:46,787 INFO L87 Difference]: Start difference. First operand 5878 states and 6388 transitions. Second operand 3 states. [2020-12-23 04:21:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:47,550 INFO L93 Difference]: Finished difference Result 11576 states and 12595 transitions. [2020-12-23 04:21:47,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:21:47,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 649 [2020-12-23 04:21:47,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:47,562 INFO L225 Difference]: With dead ends: 11576 [2020-12-23 04:21:47,562 INFO L226 Difference]: Without dead ends: 5878 [2020-12-23 04:21:47,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:21:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2020-12-23 04:21:47,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5878. [2020-12-23 04:21:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2020-12-23 04:21:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6348 transitions. [2020-12-23 04:21:47,668 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6348 transitions. Word has length 649 [2020-12-23 04:21:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:47,669 INFO L481 AbstractCegarLoop]: Abstraction has 5878 states and 6348 transitions. [2020-12-23 04:21:47,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:21:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6348 transitions. [2020-12-23 04:21:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2020-12-23 04:21:47,677 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:47,677 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, 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, 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] [2020-12-23 04:21:47,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 04:21:47,891 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:47,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1532145803, now seen corresponding path program 1 times [2020-12-23 04:21:47,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:47,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984055914] [2020-12-23 04:21:47,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 830 proven. 155 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:21:48,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984055914] [2020-12-23 04:21:48,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108279644] [2020-12-23 04:21:48,539 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 [2020-12-23 04:21:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:48,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 04:21:48,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:21:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2020-12-23 04:21:49,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:21:49,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 04:21:49,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637576262] [2020-12-23 04:21:49,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:21:49,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:49,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:21:49,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 04:21:49,737 INFO L87 Difference]: Start difference. First operand 5878 states and 6348 transitions. Second operand 3 states. [2020-12-23 04:21:50,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:50,433 INFO L93 Difference]: Finished difference Result 11576 states and 12515 transitions. [2020-12-23 04:21:50,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:21:50,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 693 [2020-12-23 04:21:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:50,452 INFO L225 Difference]: With dead ends: 11576 [2020-12-23 04:21:50,452 INFO L226 Difference]: Without dead ends: 5878 [2020-12-23 04:21:50,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 04:21:50,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2020-12-23 04:21:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5878. [2020-12-23 04:21:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2020-12-23 04:21:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6290 transitions. [2020-12-23 04:21:50,550 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6290 transitions. Word has length 693 [2020-12-23 04:21:50,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:50,551 INFO L481 AbstractCegarLoop]: Abstraction has 5878 states and 6290 transitions. [2020-12-23 04:21:50,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:21:50,551 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6290 transitions. [2020-12-23 04:21:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2020-12-23 04:21:50,560 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:50,561 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:21:50,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 04:21:50,777 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:50,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:50,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1356086777, now seen corresponding path program 1 times [2020-12-23 04:21:50,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:50,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594236177] [2020-12-23 04:21:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1788 backedges. 1114 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2020-12-23 04:21:51,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594236177] [2020-12-23 04:21:51,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:21:51,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:21:51,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954952130] [2020-12-23 04:21:51,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:21:51,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:51,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:21:51,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:51,597 INFO L87 Difference]: Start difference. First operand 5878 states and 6290 transitions. Second operand 3 states. [2020-12-23 04:21:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:52,387 INFO L93 Difference]: Finished difference Result 11576 states and 12399 transitions. [2020-12-23 04:21:52,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:21:52,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 727 [2020-12-23 04:21:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:52,398 INFO L225 Difference]: With dead ends: 11576 [2020-12-23 04:21:52,398 INFO L226 Difference]: Without dead ends: 5878 [2020-12-23 04:21:52,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:21:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2020-12-23 04:21:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5700. [2020-12-23 04:21:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2020-12-23 04:21:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 5969 transitions. [2020-12-23 04:21:52,488 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 5969 transitions. Word has length 727 [2020-12-23 04:21:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:52,488 INFO L481 AbstractCegarLoop]: Abstraction has 5700 states and 5969 transitions. [2020-12-23 04:21:52,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:21:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 5969 transitions. [2020-12-23 04:21:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2020-12-23 04:21:52,498 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:52,499 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, 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, 6, 6, 6, 6, 6, 6, 6, 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] [2020-12-23 04:21:52,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 04:21:52,499 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:52,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:52,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1370344375, now seen corresponding path program 1 times [2020-12-23 04:21:52,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:52,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452340544] [2020-12-23 04:21:52,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:53,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1279 proven. 155 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-12-23 04:21:53,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452340544] [2020-12-23 04:21:53,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113268720] [2020-12-23 04:21:53,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:21:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:53,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 04:21:53,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:21:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2020-12-23 04:21:54,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:21:54,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 04:21:54,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691377983] [2020-12-23 04:21:54,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:21:54,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:54,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:21:54,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 04:21:54,434 INFO L87 Difference]: Start difference. First operand 5700 states and 5969 transitions. Second operand 3 states. [2020-12-23 04:21:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:55,168 INFO L93 Difference]: Finished difference Result 11220 states and 11757 transitions. [2020-12-23 04:21:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:21:55,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 783 [2020-12-23 04:21:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:55,178 INFO L225 Difference]: With dead ends: 11220 [2020-12-23 04:21:55,178 INFO L226 Difference]: Without dead ends: 5700 [2020-12-23 04:21:55,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 04:21:55,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2020-12-23 04:21:55,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 4988. [2020-12-23 04:21:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2020-12-23 04:21:55,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5214 transitions. [2020-12-23 04:21:55,261 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5214 transitions. Word has length 783 [2020-12-23 04:21:55,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:55,261 INFO L481 AbstractCegarLoop]: Abstraction has 4988 states and 5214 transitions. [2020-12-23 04:21:55,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:21:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5214 transitions. [2020-12-23 04:21:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2020-12-23 04:21:55,273 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:55,274 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:21:55,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 04:21:55,488 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:55,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:55,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2039230885, now seen corresponding path program 1 times [2020-12-23 04:21:55,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:55,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887518891] [2020-12-23 04:21:55,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 1865 proven. 110 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2020-12-23 04:21:56,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887518891] [2020-12-23 04:21:56,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236374824] [2020-12-23 04:21:56,379 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 [2020-12-23 04:21:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:21:56,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 04:21:56,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:21:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 1360 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2020-12-23 04:21:58,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:21:58,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2020-12-23 04:21:58,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060409114] [2020-12-23 04:21:58,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 04:21:58,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:21:58,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 04:21:58,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:21:58,216 INFO L87 Difference]: Start difference. First operand 4988 states and 5214 transitions. Second operand 5 states. [2020-12-23 04:21:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:21:59,447 INFO L93 Difference]: Finished difference Result 11060 states and 11563 transitions. [2020-12-23 04:21:59,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 04:21:59,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 837 [2020-12-23 04:21:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:21:59,456 INFO L225 Difference]: With dead ends: 11060 [2020-12-23 04:21:59,456 INFO L226 Difference]: Without dead ends: 4632 [2020-12-23 04:21:59,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 835 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:21:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2020-12-23 04:21:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2020-12-23 04:21:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2020-12-23 04:21:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4780 transitions. [2020-12-23 04:21:59,527 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4780 transitions. Word has length 837 [2020-12-23 04:21:59,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:21:59,528 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4780 transitions. [2020-12-23 04:21:59,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 04:21:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4780 transitions. [2020-12-23 04:21:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2020-12-23 04:21:59,540 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:21:59,541 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, 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, 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, 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] [2020-12-23 04:21:59,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:21:59,756 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:21:59,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:21:59,758 INFO L82 PathProgramCache]: Analyzing trace with hash -320612692, now seen corresponding path program 1 times [2020-12-23 04:21:59,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:21:59,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176952084] [2020-12-23 04:21:59,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:21:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:22:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2326 backedges. 1708 proven. 155 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2020-12-23 04:22:00,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176952084] [2020-12-23 04:22:00,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438356826] [2020-12-23 04:22:00,585 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 [2020-12-23 04:22:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:22:00,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:22:00,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:22:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2326 backedges. 1708 proven. 155 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2020-12-23 04:22:01,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 04:22:01,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 04:22:01,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522858187] [2020-12-23 04:22:01,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:22:01,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:22:01,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:22:01,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:22:01,994 INFO L87 Difference]: Start difference. First operand 4632 states and 4780 transitions. Second operand 4 states. [2020-12-23 04:22:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:22:02,905 INFO L93 Difference]: Finished difference Result 9618 states and 9934 transitions. [2020-12-23 04:22:02,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:22:02,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 869 [2020-12-23 04:22:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:22:02,920 INFO L225 Difference]: With dead ends: 9618 [2020-12-23 04:22:02,921 INFO L226 Difference]: Without dead ends: 5344 [2020-12-23 04:22:02,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 872 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:22:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2020-12-23 04:22:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5166. [2020-12-23 04:22:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2020-12-23 04:22:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5320 transitions. [2020-12-23 04:22:03,024 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5320 transitions. Word has length 869 [2020-12-23 04:22:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:22:03,026 INFO L481 AbstractCegarLoop]: Abstraction has 5166 states and 5320 transitions. [2020-12-23 04:22:03,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:22:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5320 transitions. [2020-12-23 04:22:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2020-12-23 04:22:03,038 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:22:03,038 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 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] [2020-12-23 04:22:03,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 04:22:03,252 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:22:03,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:22:03,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2060639122, now seen corresponding path program 1 times [2020-12-23 04:22:03,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:22:03,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126405840] [2020-12-23 04:22:03,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:22:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:22:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 1015 proven. 345 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2020-12-23 04:22:04,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126405840] [2020-12-23 04:22:04,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214477777] [2020-12-23 04:22:04,975 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 [2020-12-23 04:22:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:22:05,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:22:05,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:22:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 826 proven. 0 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2020-12-23 04:22:07,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:22:07,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2020-12-23 04:22:07,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757725656] [2020-12-23 04:22:07,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:22:07,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:22:07,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:22:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:22:07,217 INFO L87 Difference]: Start difference. First operand 5166 states and 5320 transitions. Second operand 3 states. [2020-12-23 04:22:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:22:07,911 INFO L93 Difference]: Finished difference Result 9974 states and 10280 transitions. [2020-12-23 04:22:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:22:07,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 896 [2020-12-23 04:22:07,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:22:07,920 INFO L225 Difference]: With dead ends: 9974 [2020-12-23 04:22:07,920 INFO L226 Difference]: Without dead ends: 5166 [2020-12-23 04:22:07,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 899 GetRequests, 895 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:22:07,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2020-12-23 04:22:07,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 5166. [2020-12-23 04:22:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2020-12-23 04:22:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5300 transitions. [2020-12-23 04:22:07,988 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5300 transitions. Word has length 896 [2020-12-23 04:22:07,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:22:07,989 INFO L481 AbstractCegarLoop]: Abstraction has 5166 states and 5300 transitions. [2020-12-23 04:22:07,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:22:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5300 transitions. [2020-12-23 04:22:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1037 [2020-12-23 04:22:08,003 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:22:08,004 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 8, 8, 8, 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, 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, 1] [2020-12-23 04:22:08,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 04:22:08,218 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:22:08,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:22:08,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1310024199, now seen corresponding path program 1 times [2020-12-23 04:22:08,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:22:08,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894170098] [2020-12-23 04:22:08,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:22:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:22:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3529 backedges. 2476 proven. 72 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2020-12-23 04:22:09,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894170098] [2020-12-23 04:22:09,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596901843] [2020-12-23 04:22:09,369 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 [2020-12-23 04:22:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:22:09,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 04:22:09,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:22:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3529 backedges. 2189 proven. 0 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2020-12-23 04:22:11,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:22:11,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2020-12-23 04:22:11,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672561334] [2020-12-23 04:22:11,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:22:11,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:22:11,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:22:11,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:22:11,004 INFO L87 Difference]: Start difference. First operand 5166 states and 5300 transitions. Second operand 4 states. [2020-12-23 04:22:12,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:22:12,099 INFO L93 Difference]: Finished difference Result 10864 states and 11160 transitions. [2020-12-23 04:22:12,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:22:12,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1036 [2020-12-23 04:22:12,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:22:12,107 INFO L225 Difference]: With dead ends: 10864 [2020-12-23 04:22:12,107 INFO L226 Difference]: Without dead ends: 6056 [2020-12-23 04:22:12,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1040 GetRequests, 1035 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:22:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-12-23 04:22:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5878. [2020-12-23 04:22:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2020-12-23 04:22:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6024 transitions. [2020-12-23 04:22:12,188 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6024 transitions. Word has length 1036 [2020-12-23 04:22:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:22:12,189 INFO L481 AbstractCegarLoop]: Abstraction has 5878 states and 6024 transitions. [2020-12-23 04:22:12,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:22:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6024 transitions. [2020-12-23 04:22:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1184 [2020-12-23 04:22:12,205 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:22:12,206 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 7, 7, 7, 7, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 04:22:12,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:22:12,422 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:22:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:22:12,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1616010734, now seen corresponding path program 1 times [2020-12-23 04:22:12,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:22:12,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717928927] [2020-12-23 04:22:12,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:22:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:22:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 1978 proven. 0 refuted. 0 times theorem prover too weak. 2685 trivial. 0 not checked. [2020-12-23 04:22:13,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717928927] [2020-12-23 04:22:13,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:22:13,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:22:13,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713456751] [2020-12-23 04:22:13,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:22:13,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:22:13,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:22:13,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:22:13,848 INFO L87 Difference]: Start difference. First operand 5878 states and 6024 transitions. Second operand 3 states. [2020-12-23 04:22:14,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:22:14,540 INFO L93 Difference]: Finished difference Result 11398 states and 11688 transitions. [2020-12-23 04:22:14,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:22:14,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1183 [2020-12-23 04:22:14,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:22:14,549 INFO L225 Difference]: With dead ends: 11398 [2020-12-23 04:22:14,550 INFO L226 Difference]: Without dead ends: 5878 [2020-12-23 04:22:14,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:22:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2020-12-23 04:22:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5344. [2020-12-23 04:22:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2020-12-23 04:22:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5468 transitions. [2020-12-23 04:22:14,624 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5468 transitions. Word has length 1183 [2020-12-23 04:22:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:22:14,625 INFO L481 AbstractCegarLoop]: Abstraction has 5344 states and 5468 transitions. [2020-12-23 04:22:14,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:22:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5468 transitions. [2020-12-23 04:22:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1697 [2020-12-23 04:22:14,682 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:22:14,684 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, 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, 13, 13, 13, 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, 11, 10, 10, 10, 10, 9, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2020-12-23 04:22:14,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 04:22:14,684 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:22:14,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:22:14,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1424430251, now seen corresponding path program 1 times [2020-12-23 04:22:14,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:22:14,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392047467] [2020-12-23 04:22:14,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:22:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:22:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9422 backedges. 2609 proven. 0 refuted. 0 times theorem prover too weak. 6813 trivial. 0 not checked. [2020-12-23 04:22:16,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392047467] [2020-12-23 04:22:16,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:22:16,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:22:16,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93770696] [2020-12-23 04:22:16,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:22:16,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:22:16,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:22:16,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:22:16,524 INFO L87 Difference]: Start difference. First operand 5344 states and 5468 transitions. Second operand 3 states. [2020-12-23 04:22:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:22:17,201 INFO L93 Difference]: Finished difference Result 10508 states and 10755 transitions. [2020-12-23 04:22:17,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:22:17,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1696 [2020-12-23 04:22:17,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:22:17,209 INFO L225 Difference]: With dead ends: 10508 [2020-12-23 04:22:17,209 INFO L226 Difference]: Without dead ends: 5344 [2020-12-23 04:22:17,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:22:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2020-12-23 04:22:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5166. [2020-12-23 04:22:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2020-12-23 04:22:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5279 transitions. [2020-12-23 04:22:17,280 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5279 transitions. Word has length 1696 [2020-12-23 04:22:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:22:17,281 INFO L481 AbstractCegarLoop]: Abstraction has 5166 states and 5279 transitions. [2020-12-23 04:22:17,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:22:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5279 transitions. [2020-12-23 04:22:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1730 [2020-12-23 04:22:17,312 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:22:17,313 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, 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, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2020-12-23 04:22:17,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 04:22:17,314 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:22:17,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:22:17,315 INFO L82 PathProgramCache]: Analyzing trace with hash 19375012, now seen corresponding path program 1 times [2020-12-23 04:22:17,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:22:17,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796876374] [2020-12-23 04:22:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:22:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:22:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9775 backedges. 6630 proven. 0 refuted. 0 times theorem prover too weak. 3145 trivial. 0 not checked. [2020-12-23 04:22:20,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796876374] [2020-12-23 04:22:20,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:22:20,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 04:22:20,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416531936] [2020-12-23 04:22:20,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:22:20,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:22:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:22:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:22:20,148 INFO L87 Difference]: Start difference. First operand 5166 states and 5279 transitions. Second operand 4 states. [2020-12-23 04:22:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:22:21,241 INFO L93 Difference]: Finished difference Result 10152 states and 10377 transitions. [2020-12-23 04:22:21,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:22:21,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1729 [2020-12-23 04:22:21,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:22:21,250 INFO L225 Difference]: With dead ends: 10152 [2020-12-23 04:22:21,251 INFO L226 Difference]: Without dead ends: 5166 [2020-12-23 04:22:21,255 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 [2020-12-23 04:22:21,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2020-12-23 04:22:21,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 5166. [2020-12-23 04:22:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2020-12-23 04:22:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5274 transitions. [2020-12-23 04:22:21,321 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5274 transitions. Word has length 1729 [2020-12-23 04:22:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:22:21,322 INFO L481 AbstractCegarLoop]: Abstraction has 5166 states and 5274 transitions. [2020-12-23 04:22:21,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:22:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5274 transitions. [2020-12-23 04:22:21,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1747 [2020-12-23 04:22:21,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:22:21,354 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, 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, 13, 13, 13, 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, 11, 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, 1] [2020-12-23 04:22:21,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 04:22:21,355 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:22:21,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:22:21,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1276225934, now seen corresponding path program 1 times [2020-12-23 04:22:21,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:22:21,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207715976] [2020-12-23 04:22:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:22:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:22:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9575 backedges. 2804 proven. 1045 refuted. 0 times theorem prover too weak. 5726 trivial. 0 not checked. [2020-12-23 04:22:24,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207715976] [2020-12-23 04:22:24,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630396420] [2020-12-23 04:22:24,398 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 [2020-12-23 04:22:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:22:24,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 2137 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 04:22:24,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:22:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9575 backedges. 3849 proven. 0 refuted. 0 times theorem prover too weak. 5726 trivial. 0 not checked. [2020-12-23 04:22:27,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:22:27,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-12-23 04:22:27,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764518359] [2020-12-23 04:22:27,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:22:27,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:22:27,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:22:27,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:22:27,465 INFO L87 Difference]: Start difference. First operand 5166 states and 5274 transitions. Second operand 3 states. [2020-12-23 04:22:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:22:28,109 INFO L93 Difference]: Finished difference Result 11042 states and 11256 transitions. [2020-12-23 04:22:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:22:28,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1746 [2020-12-23 04:22:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:22:28,114 INFO L225 Difference]: With dead ends: 11042 [2020-12-23 04:22:28,114 INFO L226 Difference]: Without dead ends: 3564 [2020-12-23 04:22:28,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1749 GetRequests, 1745 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:22:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2020-12-23 04:22:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2020-12-23 04:22:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2020-12-23 04:22:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3602 transitions. [2020-12-23 04:22:28,146 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3602 transitions. Word has length 1746 [2020-12-23 04:22:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:22:28,148 INFO L481 AbstractCegarLoop]: Abstraction has 3564 states and 3602 transitions. [2020-12-23 04:22:28,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:22:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3602 transitions. [2020-12-23 04:22:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1818 [2020-12-23 04:22:28,175 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:22:28,176 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 1] [2020-12-23 04:22:28,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-23 04:22:28,391 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:22:28,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:22:28,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1727618608, now seen corresponding path program 1 times [2020-12-23 04:22:28,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:22:28,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178079107] [2020-12-23 04:22:28,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:22:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:22:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10935 backedges. 2784 proven. 0 refuted. 0 times theorem prover too weak. 8151 trivial. 0 not checked. [2020-12-23 04:22:32,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178079107] [2020-12-23 04:22:32,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:22:32,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 04:22:32,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773662133] [2020-12-23 04:22:32,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 04:22:32,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:22:32,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 04:22:32,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 04:22:32,044 INFO L87 Difference]: Start difference. First operand 3564 states and 3602 transitions. Second operand 5 states. [2020-12-23 04:22:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:22:33,103 INFO L93 Difference]: Finished difference Result 4461 states and 4515 transitions. [2020-12-23 04:22:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 04:22:33,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1817 [2020-12-23 04:22:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:22:33,108 INFO L225 Difference]: With dead ends: 4461 [2020-12-23 04:22:33,108 INFO L226 Difference]: Without dead ends: 4276 [2020-12-23 04:22:33,109 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 [2020-12-23 04:22:33,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2020-12-23 04:22:33,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3920. [2020-12-23 04:22:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2020-12-23 04:22:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3965 transitions. [2020-12-23 04:22:33,152 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3965 transitions. Word has length 1817 [2020-12-23 04:22:33,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:22:33,154 INFO L481 AbstractCegarLoop]: Abstraction has 3920 states and 3965 transitions. [2020-12-23 04:22:33,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 04:22:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3965 transitions. [2020-12-23 04:22:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2120 [2020-12-23 04:22:33,191 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:22:33,193 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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, 17, 17, 16, 16, 16, 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, 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, 1] [2020-12-23 04:22:33,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 04:22:33,193 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:22:33,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:22:33,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2140269625, now seen corresponding path program 1 times [2020-12-23 04:22:33,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:22:33,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096588095] [2020-12-23 04:22:33,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:22:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:22:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 14529 backedges. 3210 proven. 0 refuted. 0 times theorem prover too weak. 11319 trivial. 0 not checked. [2020-12-23 04:22:38,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096588095] [2020-12-23 04:22:38,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:22:38,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 04:22:38,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561414619] [2020-12-23 04:22:38,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:22:38,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:22:38,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:22:38,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:22:38,091 INFO L87 Difference]: Start difference. First operand 3920 states and 3965 transitions. Second operand 4 states. [2020-12-23 04:22:39,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:22:39,050 INFO L93 Difference]: Finished difference Result 3925 states and 3970 transitions. [2020-12-23 04:22:39,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:22:39,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2119 [2020-12-23 04:22:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:22:39,053 INFO L225 Difference]: With dead ends: 3925 [2020-12-23 04:22:39,053 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 04:22:39,054 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 [2020-12-23 04:22:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 04:22:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 04:22:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 04:22:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 04:22:39,055 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2119 [2020-12-23 04:22:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:22:39,055 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 04:22:39,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:22:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 04:22:39,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 04:22:39,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 04:22:39,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 04:22:39,215 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 170 [2020-12-23 04:22:39,331 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 170 [2020-12-23 04:22:40,976 WARN L197 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 167 DAG size of output: 90 [2020-12-23 04:22:42,635 WARN L197 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 167 DAG size of output: 90 [2020-12-23 04:22:42,640 INFO L189 CegarLoopUtils]: For program point L762(lines 762 880) no Hoare annotation was computed. [2020-12-23 04:22:42,640 INFO L189 CegarLoopUtils]: For program point L895(line 895) no Hoare annotation was computed. [2020-12-23 04:22:42,640 INFO L189 CegarLoopUtils]: For program point L829(lines 829 880) no Hoare annotation was computed. [2020-12-23 04:22:42,640 INFO L189 CegarLoopUtils]: For program point L631(lines 631 880) no Hoare annotation was computed. [2020-12-23 04:22:42,640 INFO L189 CegarLoopUtils]: For program point L565(lines 565 880) no Hoare annotation was computed. [2020-12-23 04:22:42,641 INFO L189 CegarLoopUtils]: For program point L169-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,641 INFO L189 CegarLoopUtils]: For program point L103-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,641 INFO L189 CegarLoopUtils]: For program point L37-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,641 INFO L189 CegarLoopUtils]: For program point L698(lines 698 880) no Hoare annotation was computed. [2020-12-23 04:22:42,641 INFO L189 CegarLoopUtils]: For program point L500(lines 500 880) no Hoare annotation was computed. [2020-12-23 04:22:42,641 INFO L189 CegarLoopUtils]: For program point L170(line 170) no Hoare annotation was computed. [2020-12-23 04:22:42,642 INFO L189 CegarLoopUtils]: For program point L104(line 104) no Hoare annotation was computed. [2020-12-23 04:22:42,642 INFO L189 CegarLoopUtils]: For program point L38(line 38) no Hoare annotation was computed. [2020-12-23 04:22:42,642 INFO L189 CegarLoopUtils]: For program point L369(lines 369 880) no Hoare annotation was computed. [2020-12-23 04:22:42,642 INFO L189 CegarLoopUtils]: For program point L303(lines 303 880) no Hoare annotation was computed. [2020-12-23 04:22:42,642 INFO L189 CegarLoopUtils]: For program point L436(lines 436 880) no Hoare annotation was computed. [2020-12-23 04:22:42,642 INFO L189 CegarLoopUtils]: For program point L172-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,642 INFO L189 CegarLoopUtils]: For program point L106-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,642 INFO L189 CegarLoopUtils]: For program point L40-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,643 INFO L189 CegarLoopUtils]: For program point L239(lines 239 880) no Hoare annotation was computed. [2020-12-23 04:22:42,643 INFO L189 CegarLoopUtils]: For program point L173(line 173) no Hoare annotation was computed. [2020-12-23 04:22:42,643 INFO L189 CegarLoopUtils]: For program point L107(line 107) no Hoare annotation was computed. [2020-12-23 04:22:42,643 INFO L189 CegarLoopUtils]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-23 04:22:42,643 INFO L189 CegarLoopUtils]: For program point L768(lines 768 880) no Hoare annotation was computed. [2020-12-23 04:22:42,643 INFO L189 CegarLoopUtils]: For program point L636(lines 636 880) no Hoare annotation was computed. [2020-12-23 04:22:42,643 INFO L189 CegarLoopUtils]: For program point L835(lines 835 880) no Hoare annotation was computed. [2020-12-23 04:22:42,643 INFO L189 CegarLoopUtils]: For program point L571(lines 571 880) no Hoare annotation was computed. [2020-12-23 04:22:42,643 INFO L189 CegarLoopUtils]: For program point L505(lines 505 880) no Hoare annotation was computed. [2020-12-23 04:22:42,643 INFO L189 CegarLoopUtils]: For program point L175-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,644 INFO L189 CegarLoopUtils]: For program point L109-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,644 INFO L189 CegarLoopUtils]: For program point L43-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,644 INFO L189 CegarLoopUtils]: For program point L704(lines 704 880) no Hoare annotation was computed. [2020-12-23 04:22:42,644 INFO L189 CegarLoopUtils]: For program point L176(line 176) no Hoare annotation was computed. [2020-12-23 04:22:42,644 INFO L189 CegarLoopUtils]: For program point L110(line 110) no Hoare annotation was computed. [2020-12-23 04:22:42,644 INFO L189 CegarLoopUtils]: For program point L44(line 44) no Hoare annotation was computed. [2020-12-23 04:22:42,644 INFO L189 CegarLoopUtils]: For program point L309(lines 309 880) no Hoare annotation was computed. [2020-12-23 04:22:42,644 INFO L189 CegarLoopUtils]: For program point L442(lines 442 880) no Hoare annotation was computed. [2020-12-23 04:22:42,644 INFO L189 CegarLoopUtils]: For program point L376(lines 376 880) no Hoare annotation was computed. [2020-12-23 04:22:42,644 INFO L189 CegarLoopUtils]: For program point L178-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,645 INFO L189 CegarLoopUtils]: For program point L112-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,645 INFO L189 CegarLoopUtils]: For program point L46-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,645 INFO L189 CegarLoopUtils]: For program point L245(lines 245 880) no Hoare annotation was computed. [2020-12-23 04:22:42,645 INFO L189 CegarLoopUtils]: For program point L179(line 179) no Hoare annotation was computed. [2020-12-23 04:22:42,645 INFO L189 CegarLoopUtils]: For program point L113(line 113) no Hoare annotation was computed. [2020-12-23 04:22:42,645 INFO L189 CegarLoopUtils]: For program point L47(line 47) no Hoare annotation was computed. [2020-12-23 04:22:42,645 INFO L189 CegarLoopUtils]: For program point L774(lines 774 880) no Hoare annotation was computed. [2020-12-23 04:22:42,645 INFO L189 CegarLoopUtils]: For program point L642(lines 642 880) no Hoare annotation was computed. [2020-12-23 04:22:42,645 INFO L189 CegarLoopUtils]: For program point L510(lines 510 880) no Hoare annotation was computed. [2020-12-23 04:22:42,645 INFO L189 CegarLoopUtils]: For program point L841(lines 841 880) no Hoare annotation was computed. [2020-12-23 04:22:42,645 INFO L189 CegarLoopUtils]: For program point L181-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,646 INFO L189 CegarLoopUtils]: For program point L115-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,646 INFO L189 CegarLoopUtils]: For program point L49-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,646 INFO L189 CegarLoopUtils]: For program point L710(lines 710 880) no Hoare annotation was computed. [2020-12-23 04:22:42,646 INFO L189 CegarLoopUtils]: For program point L578(lines 578 880) no Hoare annotation was computed. [2020-12-23 04:22:42,646 INFO L189 CegarLoopUtils]: For program point L182(line 182) no Hoare annotation was computed. [2020-12-23 04:22:42,646 INFO L189 CegarLoopUtils]: For program point L116(line 116) no Hoare annotation was computed. [2020-12-23 04:22:42,646 INFO L189 CegarLoopUtils]: For program point L50(line 50) no Hoare annotation was computed. [2020-12-23 04:22:42,646 INFO L189 CegarLoopUtils]: For program point L315(lines 315 880) no Hoare annotation was computed. [2020-12-23 04:22:42,646 INFO L189 CegarLoopUtils]: For program point L448(lines 448 880) no Hoare annotation was computed. [2020-12-23 04:22:42,646 INFO L189 CegarLoopUtils]: For program point L382(lines 382 880) no Hoare annotation was computed. [2020-12-23 04:22:42,646 INFO L189 CegarLoopUtils]: For program point L184-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,647 INFO L189 CegarLoopUtils]: For program point L118-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,647 INFO L189 CegarLoopUtils]: For program point L52-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,647 INFO L189 CegarLoopUtils]: For program point L251(lines 251 880) no Hoare annotation was computed. [2020-12-23 04:22:42,647 INFO L189 CegarLoopUtils]: For program point L185(line 185) no Hoare annotation was computed. [2020-12-23 04:22:42,647 INFO L189 CegarLoopUtils]: For program point L119(line 119) no Hoare annotation was computed. [2020-12-23 04:22:42,647 INFO L189 CegarLoopUtils]: For program point L53(line 53) no Hoare annotation was computed. [2020-12-23 04:22:42,647 INFO L189 CegarLoopUtils]: For program point L648(lines 648 880) no Hoare annotation was computed. [2020-12-23 04:22:42,647 INFO L189 CegarLoopUtils]: For program point L516(lines 516 880) no Hoare annotation was computed. [2020-12-23 04:22:42,647 INFO L189 CegarLoopUtils]: For program point L847(lines 847 880) no Hoare annotation was computed. [2020-12-23 04:22:42,647 INFO L189 CegarLoopUtils]: For program point L781(lines 781 880) no Hoare annotation was computed. [2020-12-23 04:22:42,647 INFO L189 CegarLoopUtils]: For program point L583(lines 583 880) no Hoare annotation was computed. [2020-12-23 04:22:42,648 INFO L189 CegarLoopUtils]: For program point L187-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,648 INFO L189 CegarLoopUtils]: For program point L121-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,648 INFO L189 CegarLoopUtils]: For program point L55-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,648 INFO L189 CegarLoopUtils]: For program point L716(lines 716 880) no Hoare annotation was computed. [2020-12-23 04:22:42,648 INFO L189 CegarLoopUtils]: For program point L188(line 188) no Hoare annotation was computed. [2020-12-23 04:22:42,648 INFO L189 CegarLoopUtils]: For program point L122(line 122) no Hoare annotation was computed. [2020-12-23 04:22:42,648 INFO L189 CegarLoopUtils]: For program point L56(line 56) no Hoare annotation was computed. [2020-12-23 04:22:42,648 INFO L189 CegarLoopUtils]: For program point L321(lines 321 880) no Hoare annotation was computed. [2020-12-23 04:22:42,648 INFO L189 CegarLoopUtils]: For program point L454(lines 454 880) no Hoare annotation was computed. [2020-12-23 04:22:42,648 INFO L189 CegarLoopUtils]: For program point L388(lines 388 880) no Hoare annotation was computed. [2020-12-23 04:22:42,648 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 04:22:42,649 INFO L189 CegarLoopUtils]: For program point L190-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,649 INFO L189 CegarLoopUtils]: For program point L124-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,649 INFO L189 CegarLoopUtils]: For program point L58-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,649 INFO L189 CegarLoopUtils]: For program point L257(lines 257 880) no Hoare annotation was computed. [2020-12-23 04:22:42,649 INFO L189 CegarLoopUtils]: For program point L191(line 191) no Hoare annotation was computed. [2020-12-23 04:22:42,649 INFO L189 CegarLoopUtils]: For program point L125(line 125) no Hoare annotation was computed. [2020-12-23 04:22:42,649 INFO L189 CegarLoopUtils]: For program point L59(line 59) no Hoare annotation was computed. [2020-12-23 04:22:42,649 INFO L189 CegarLoopUtils]: For program point L852(lines 852 880) no Hoare annotation was computed. [2020-12-23 04:22:42,649 INFO L189 CegarLoopUtils]: For program point L654(lines 654 880) no Hoare annotation was computed. [2020-12-23 04:22:42,649 INFO L189 CegarLoopUtils]: For program point L522(lines 522 880) no Hoare annotation was computed. [2020-12-23 04:22:42,649 INFO L189 CegarLoopUtils]: For program point L787(lines 787 880) no Hoare annotation was computed. [2020-12-23 04:22:42,650 INFO L189 CegarLoopUtils]: For program point L589(lines 589 880) no Hoare annotation was computed. [2020-12-23 04:22:42,650 INFO L189 CegarLoopUtils]: For program point L193-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,650 INFO L189 CegarLoopUtils]: For program point L127-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,650 INFO L189 CegarLoopUtils]: For program point L61-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,650 INFO L189 CegarLoopUtils]: For program point L722(lines 722 880) no Hoare annotation was computed. [2020-12-23 04:22:42,650 INFO L189 CegarLoopUtils]: For program point L194(line 194) no Hoare annotation was computed. [2020-12-23 04:22:42,650 INFO L189 CegarLoopUtils]: For program point L128(line 128) no Hoare annotation was computed. [2020-12-23 04:22:42,650 INFO L189 CegarLoopUtils]: For program point L62(line 62) no Hoare annotation was computed. [2020-12-23 04:22:42,650 INFO L189 CegarLoopUtils]: For program point L459(lines 459 880) no Hoare annotation was computed. [2020-12-23 04:22:42,650 INFO L189 CegarLoopUtils]: For program point L327(lines 327 880) no Hoare annotation was computed. [2020-12-23 04:22:42,650 INFO L189 CegarLoopUtils]: For program point L394(lines 394 880) no Hoare annotation was computed. [2020-12-23 04:22:42,651 INFO L189 CegarLoopUtils]: For program point L262(lines 262 880) no Hoare annotation was computed. [2020-12-23 04:22:42,651 INFO L189 CegarLoopUtils]: For program point L196-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,651 INFO L189 CegarLoopUtils]: For program point L130-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,651 INFO L189 CegarLoopUtils]: For program point L64-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,651 INFO L189 CegarLoopUtils]: For program point L197(line 197) no Hoare annotation was computed. [2020-12-23 04:22:42,651 INFO L189 CegarLoopUtils]: For program point L131(line 131) no Hoare annotation was computed. [2020-12-23 04:22:42,651 INFO L189 CegarLoopUtils]: For program point L65(line 65) no Hoare annotation was computed. [2020-12-23 04:22:42,651 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 04:22:42,651 INFO L189 CegarLoopUtils]: For program point L858(lines 858 880) no Hoare annotation was computed. [2020-12-23 04:22:42,651 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 131) no Hoare annotation was computed. [2020-12-23 04:22:42,651 INFO L189 CegarLoopUtils]: For program point L660(lines 660 880) no Hoare annotation was computed. [2020-12-23 04:22:42,652 INFO L189 CegarLoopUtils]: For program point L528(lines 528 880) no Hoare annotation was computed. [2020-12-23 04:22:42,652 INFO L189 CegarLoopUtils]: For program point L793(lines 793 880) no Hoare annotation was computed. [2020-12-23 04:22:42,652 INFO L189 CegarLoopUtils]: For program point L595(lines 595 880) no Hoare annotation was computed. [2020-12-23 04:22:42,652 INFO L189 CegarLoopUtils]: For program point L199-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,652 INFO L189 CegarLoopUtils]: For program point L133-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,652 INFO L189 CegarLoopUtils]: For program point L67-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,652 INFO L189 CegarLoopUtils]: For program point L728(lines 728 880) no Hoare annotation was computed. [2020-12-23 04:22:42,652 INFO L189 CegarLoopUtils]: For program point L464(lines 464 880) no Hoare annotation was computed. [2020-12-23 04:22:42,652 INFO L189 CegarLoopUtils]: For program point L200(line 200) no Hoare annotation was computed. [2020-12-23 04:22:42,652 INFO L189 CegarLoopUtils]: For program point L134(line 134) no Hoare annotation was computed. [2020-12-23 04:22:42,652 INFO L189 CegarLoopUtils]: For program point L68(line 68) no Hoare annotation was computed. [2020-12-23 04:22:42,653 INFO L189 CegarLoopUtils]: For program point L333(lines 333 880) no Hoare annotation was computed. [2020-12-23 04:22:42,653 INFO L189 CegarLoopUtils]: For program point L400(lines 400 880) no Hoare annotation was computed. [2020-12-23 04:22:42,653 INFO L189 CegarLoopUtils]: For program point L268(lines 268 880) no Hoare annotation was computed. [2020-12-23 04:22:42,653 INFO L189 CegarLoopUtils]: For program point L202-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,653 INFO L189 CegarLoopUtils]: For program point L136-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,653 INFO L189 CegarLoopUtils]: For program point L70-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,653 INFO L189 CegarLoopUtils]: For program point L203(line 203) no Hoare annotation was computed. [2020-12-23 04:22:42,653 INFO L189 CegarLoopUtils]: For program point L137(line 137) no Hoare annotation was computed. [2020-12-23 04:22:42,653 INFO L189 CegarLoopUtils]: For program point L71(line 71) no Hoare annotation was computed. [2020-12-23 04:22:42,653 INFO L189 CegarLoopUtils]: For program point L864(lines 864 880) no Hoare annotation was computed. [2020-12-23 04:22:42,653 INFO L189 CegarLoopUtils]: For program point L666(lines 666 880) no Hoare annotation was computed. [2020-12-23 04:22:42,653 INFO L189 CegarLoopUtils]: For program point L534(lines 534 880) no Hoare annotation was computed. [2020-12-23 04:22:42,654 INFO L189 CegarLoopUtils]: For program point L799(lines 799 880) no Hoare annotation was computed. [2020-12-23 04:22:42,654 INFO L189 CegarLoopUtils]: For program point L601(lines 601 880) no Hoare annotation was computed. [2020-12-23 04:22:42,654 INFO L189 CegarLoopUtils]: For program point L205-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,654 INFO L189 CegarLoopUtils]: For program point L139-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,654 INFO L189 CegarLoopUtils]: For program point L73-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,654 INFO L189 CegarLoopUtils]: For program point L734(lines 734 880) no Hoare annotation was computed. [2020-12-23 04:22:42,654 INFO L189 CegarLoopUtils]: For program point L470(lines 470 880) no Hoare annotation was computed. [2020-12-23 04:22:42,654 INFO L189 CegarLoopUtils]: For program point L206(line 206) no Hoare annotation was computed. [2020-12-23 04:22:42,654 INFO L189 CegarLoopUtils]: For program point L140(line 140) no Hoare annotation was computed. [2020-12-23 04:22:42,654 INFO L189 CegarLoopUtils]: For program point L74(line 74) no Hoare annotation was computed. [2020-12-23 04:22:42,654 INFO L189 CegarLoopUtils]: For program point L339(lines 339 880) no Hoare annotation was computed. [2020-12-23 04:22:42,654 INFO L189 CegarLoopUtils]: For program point L406(lines 406 880) no Hoare annotation was computed. [2020-12-23 04:22:42,655 INFO L189 CegarLoopUtils]: For program point L274(lines 274 880) no Hoare annotation was computed. [2020-12-23 04:22:42,655 INFO L189 CegarLoopUtils]: For program point L208-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,655 INFO L189 CegarLoopUtils]: For program point L142-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,655 INFO L189 CegarLoopUtils]: For program point L76-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,655 INFO L189 CegarLoopUtils]: For program point L869(lines 869 880) no Hoare annotation was computed. [2020-12-23 04:22:42,655 INFO L189 CegarLoopUtils]: For program point L209(line 209) no Hoare annotation was computed. [2020-12-23 04:22:42,655 INFO L189 CegarLoopUtils]: For program point L143(line 143) no Hoare annotation was computed. [2020-12-23 04:22:42,655 INFO L189 CegarLoopUtils]: For program point L77(line 77) no Hoare annotation was computed. [2020-12-23 04:22:42,655 INFO L189 CegarLoopUtils]: For program point L672(lines 672 880) no Hoare annotation was computed. [2020-12-23 04:22:42,655 INFO L189 CegarLoopUtils]: For program point L540(lines 540 880) no Hoare annotation was computed. [2020-12-23 04:22:42,655 INFO L189 CegarLoopUtils]: For program point L805(lines 805 880) no Hoare annotation was computed. [2020-12-23 04:22:42,655 INFO L189 CegarLoopUtils]: For program point L607(lines 607 880) no Hoare annotation was computed. [2020-12-23 04:22:42,656 INFO L189 CegarLoopUtils]: For program point L211-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,656 INFO L189 CegarLoopUtils]: For program point L145-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,656 INFO L189 CegarLoopUtils]: For program point L79-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,656 INFO L189 CegarLoopUtils]: For program point L740(lines 740 880) no Hoare annotation was computed. [2020-12-23 04:22:42,656 INFO L189 CegarLoopUtils]: For program point L212(line 212) no Hoare annotation was computed. [2020-12-23 04:22:42,656 INFO L189 CegarLoopUtils]: For program point L146(line 146) no Hoare annotation was computed. [2020-12-23 04:22:42,656 INFO L189 CegarLoopUtils]: For program point L80(line 80) no Hoare annotation was computed. [2020-12-23 04:22:42,656 INFO L189 CegarLoopUtils]: For program point L477(lines 477 880) no Hoare annotation was computed. [2020-12-23 04:22:42,656 INFO L189 CegarLoopUtils]: For program point L345(lines 345 880) no Hoare annotation was computed. [2020-12-23 04:22:42,656 INFO L189 CegarLoopUtils]: For program point L279(lines 279 880) no Hoare annotation was computed. [2020-12-23 04:22:42,656 INFO L189 CegarLoopUtils]: For program point L412(lines 412 880) no Hoare annotation was computed. [2020-12-23 04:22:42,656 INFO L189 CegarLoopUtils]: For program point L148-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,657 INFO L189 CegarLoopUtils]: For program point L82-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,657 INFO L189 CegarLoopUtils]: For program point L875(lines 875 880) no Hoare annotation was computed. [2020-12-23 04:22:42,657 INFO L189 CegarLoopUtils]: For program point L149(line 149) no Hoare annotation was computed. [2020-12-23 04:22:42,657 INFO L189 CegarLoopUtils]: For program point L83(line 83) no Hoare annotation was computed. [2020-12-23 04:22:42,657 INFO L189 CegarLoopUtils]: For program point L678(lines 678 880) no Hoare annotation was computed. [2020-12-23 04:22:42,657 INFO L189 CegarLoopUtils]: For program point L546(lines 546 880) no Hoare annotation was computed. [2020-12-23 04:22:42,657 INFO L189 CegarLoopUtils]: For program point L811(lines 811 880) no Hoare annotation was computed. [2020-12-23 04:22:42,657 INFO L189 CegarLoopUtils]: For program point L745(lines 745 880) no Hoare annotation was computed. [2020-12-23 04:22:42,657 INFO L189 CegarLoopUtils]: For program point L613(lines 613 880) no Hoare annotation was computed. [2020-12-23 04:22:42,657 INFO L189 CegarLoopUtils]: For program point L151-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,657 INFO L189 CegarLoopUtils]: For program point L85-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,657 INFO L189 CegarLoopUtils]: For program point L482(lines 482 880) no Hoare annotation was computed. [2020-12-23 04:22:42,658 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 04:22:42,658 INFO L189 CegarLoopUtils]: For program point L152(line 152) no Hoare annotation was computed. [2020-12-23 04:22:42,658 INFO L189 CegarLoopUtils]: For program point L86(line 86) no Hoare annotation was computed. [2020-12-23 04:22:42,658 INFO L189 CegarLoopUtils]: For program point L351(lines 351 880) no Hoare annotation was computed. [2020-12-23 04:22:42,658 INFO L189 CegarLoopUtils]: For program point L285(lines 285 880) no Hoare annotation was computed. [2020-12-23 04:22:42,658 INFO L189 CegarLoopUtils]: For program point L418(lines 418 880) no Hoare annotation was computed. [2020-12-23 04:22:42,658 INFO L189 CegarLoopUtils]: For program point L154-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,658 INFO L189 CegarLoopUtils]: For program point L88-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,659 INFO L185 CegarLoopUtils]: At program point L881(lines 30 882) the Hoare annotation is: (let ((.cse7 (let ((.cse17 (div (+ ~a12~0 (- 600066)) 5))) (or (<= (+ .cse17 14) 0) (and (let ((.cse18 (+ ~a12~0 4))) (= .cse18 (* (div .cse18 5) 5))) (<= (+ .cse17 13) 0))))) (.cse3 (<= 9 ~a15~0)) (.cse16 (<= 9 ~a21~0)) (.cse0 (<= 0 (+ ~a12~0 42))) (.cse8 (<= 23 ~a12~0)) (.cse9 (<= ~a21~0 7)) (.cse6 (<= 7 ~a21~0)) (.cse1 (<= 8 ~a21~0)) (.cse13 (< 11 ~a12~0)) (.cse11 (<= ~a15~0 8)) (.cse4 (<= ~a12~0 73282)) (.cse5 (<= ~a21~0 8)) (.cse15 (<= 10 ~a21~0)) (.cse2 (= ~a24~0 1)) (.cse12 (<= ~a15~0 7)) (.cse10 (<= ~a12~0 11)) (.cse14 (<= ~a21~0 6))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse2 .cse3) (and .cse9 .cse6 .cse0 .cse10 .cse2 .cse11) (and (= 5 ~a15~0) .cse9 (<= ~a24~0 1) .cse10) (and .cse9 .cse12 .cse2) (and .cse7 (or (and .cse2 .cse13 .cse11 .cse14) (and .cse2 .cse11 .cse15))) (and .cse16 .cse12 .cse2) (and .cse1 .cse2 .cse3 (<= (+ ~a12~0 526767) 0) .cse5) (and .cse16 .cse2 .cse13 .cse11 (<= ~a12~0 76)) (and .cse16 .cse0 .cse10 .cse2 .cse11) (and .cse8 (<= ~a12~0 586307) .cse2 .cse14) (and .cse12 .cse1 .cse2 .cse13 .cse11 .cse5) (and .cse9 .cse6 (<= (+ ~a12~0 49) 0) .cse2 .cse11) (and .cse1 .cse2 .cse13 .cse11 .cse4 .cse5) (and .cse10 .cse2 .cse15) (and (= 7 ~a15~0) .cse2 (<= (+ ~a12~0 44) 0)) (and .cse12 .cse10 .cse14))) [2020-12-23 04:22:42,659 INFO L189 CegarLoopUtils]: For program point L551(lines 551 880) no Hoare annotation was computed. [2020-12-23 04:22:42,659 INFO L189 CegarLoopUtils]: For program point L221(lines 221 880) no Hoare annotation was computed. [2020-12-23 04:22:42,659 INFO L189 CegarLoopUtils]: For program point L155(line 155) no Hoare annotation was computed. [2020-12-23 04:22:42,659 INFO L189 CegarLoopUtils]: For program point L89(line 89) no Hoare annotation was computed. [2020-12-23 04:22:42,659 INFO L189 CegarLoopUtils]: For program point L684(lines 684 880) no Hoare annotation was computed. [2020-12-23 04:22:42,659 INFO L189 CegarLoopUtils]: For program point L817(lines 817 880) no Hoare annotation was computed. [2020-12-23 04:22:42,659 INFO L189 CegarLoopUtils]: For program point L751(lines 751 880) no Hoare annotation was computed. [2020-12-23 04:22:42,659 INFO L189 CegarLoopUtils]: For program point L619(lines 619 880) no Hoare annotation was computed. [2020-12-23 04:22:42,659 INFO L189 CegarLoopUtils]: For program point L157-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,660 INFO L189 CegarLoopUtils]: For program point L91-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,660 INFO L192 CegarLoopUtils]: At program point L884(lines 884 900) the Hoare annotation is: true [2020-12-23 04:22:42,660 INFO L189 CegarLoopUtils]: For program point L488(lines 488 880) no Hoare annotation was computed. [2020-12-23 04:22:42,660 INFO L189 CegarLoopUtils]: For program point L290(lines 290 880) no Hoare annotation was computed. [2020-12-23 04:22:42,660 INFO L189 CegarLoopUtils]: For program point L158(line 158) no Hoare annotation was computed. [2020-12-23 04:22:42,660 INFO L189 CegarLoopUtils]: For program point L92(line 92) no Hoare annotation was computed. [2020-12-23 04:22:42,660 INFO L189 CegarLoopUtils]: For program point L687(lines 687 880) no Hoare annotation was computed. [2020-12-23 04:22:42,660 INFO L189 CegarLoopUtils]: For program point L357(lines 357 880) no Hoare annotation was computed. [2020-12-23 04:22:42,660 INFO L189 CegarLoopUtils]: For program point L424(lines 424 880) no Hoare annotation was computed. [2020-12-23 04:22:42,660 INFO L189 CegarLoopUtils]: For program point L160-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,660 INFO L189 CegarLoopUtils]: For program point L94-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,661 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 04:22:42,661 INFO L189 CegarLoopUtils]: For program point L557(lines 557 880) no Hoare annotation was computed. [2020-12-23 04:22:42,661 INFO L189 CegarLoopUtils]: For program point L227(lines 227 880) no Hoare annotation was computed. [2020-12-23 04:22:42,661 INFO L189 CegarLoopUtils]: For program point L161(line 161) no Hoare annotation was computed. [2020-12-23 04:22:42,661 INFO L189 CegarLoopUtils]: For program point L95(line 95) no Hoare annotation was computed. [2020-12-23 04:22:42,661 INFO L189 CegarLoopUtils]: For program point L757(lines 757 880) no Hoare annotation was computed. [2020-12-23 04:22:42,661 INFO L189 CegarLoopUtils]: For program point L625(lines 625 880) no Hoare annotation was computed. [2020-12-23 04:22:42,661 INFO L189 CegarLoopUtils]: For program point L163-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,661 INFO L189 CegarLoopUtils]: For program point L97-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,661 INFO L189 CegarLoopUtils]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-12-23 04:22:42,661 INFO L189 CegarLoopUtils]: For program point L31-2(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,661 INFO L189 CegarLoopUtils]: For program point L824(lines 824 880) no Hoare annotation was computed. [2020-12-23 04:22:42,662 INFO L185 CegarLoopUtils]: At program point L890-2(lines 890 899) the Hoare annotation is: (let ((.cse7 (let ((.cse17 (div (+ ~a12~0 (- 600066)) 5))) (or (<= (+ .cse17 14) 0) (and (let ((.cse18 (+ ~a12~0 4))) (= .cse18 (* (div .cse18 5) 5))) (<= (+ .cse17 13) 0))))) (.cse3 (<= 9 ~a15~0)) (.cse16 (<= 9 ~a21~0)) (.cse0 (<= 0 (+ ~a12~0 42))) (.cse8 (<= 23 ~a12~0)) (.cse9 (<= ~a21~0 7)) (.cse6 (<= 7 ~a21~0)) (.cse1 (<= 8 ~a21~0)) (.cse13 (< 11 ~a12~0)) (.cse11 (<= ~a15~0 8)) (.cse4 (<= ~a12~0 73282)) (.cse5 (<= ~a21~0 8)) (.cse15 (<= 10 ~a21~0)) (.cse2 (= ~a24~0 1)) (.cse12 (<= ~a15~0 7)) (.cse10 (<= ~a12~0 11)) (.cse14 (<= ~a21~0 6))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse2 .cse3) (and .cse9 .cse6 .cse0 .cse10 .cse2 .cse11) (and (= 5 ~a15~0) .cse9 (<= ~a24~0 1) .cse10) (and .cse9 .cse12 .cse2) (and .cse7 (or (and .cse2 .cse13 .cse11 .cse14) (and .cse2 .cse11 .cse15))) (and .cse16 .cse12 .cse2) (and .cse1 .cse2 .cse3 (<= (+ ~a12~0 526767) 0) .cse5) (and .cse16 .cse2 .cse13 .cse11 (<= ~a12~0 76)) (and .cse16 .cse0 .cse10 .cse2 .cse11) (and .cse8 (<= ~a12~0 586307) .cse2 .cse14) (and .cse12 .cse1 .cse2 .cse13 .cse11 .cse5) (and .cse9 .cse6 (<= (+ ~a12~0 49) 0) .cse2 .cse11) (and .cse1 .cse2 .cse13 .cse11 .cse4 .cse5) (and .cse10 .cse2 .cse15) (and (= 7 ~a15~0) .cse2 (<= (+ ~a12~0 44) 0)) (and .cse12 .cse10 .cse14))) [2020-12-23 04:22:42,662 INFO L189 CegarLoopUtils]: For program point L494(lines 494 880) no Hoare annotation was computed. [2020-12-23 04:22:42,662 INFO L189 CegarLoopUtils]: For program point L296(lines 296 880) no Hoare annotation was computed. [2020-12-23 04:22:42,662 INFO L189 CegarLoopUtils]: For program point L164(line 164) no Hoare annotation was computed. [2020-12-23 04:22:42,662 INFO L189 CegarLoopUtils]: For program point L98(line 98) no Hoare annotation was computed. [2020-12-23 04:22:42,662 INFO L189 CegarLoopUtils]: For program point L32(line 32) no Hoare annotation was computed. [2020-12-23 04:22:42,662 INFO L189 CegarLoopUtils]: For program point L693(lines 693 880) no Hoare annotation was computed. [2020-12-23 04:22:42,662 INFO L189 CegarLoopUtils]: For program point L363(lines 363 880) no Hoare annotation was computed. [2020-12-23 04:22:42,662 INFO L189 CegarLoopUtils]: For program point L562(lines 562 880) no Hoare annotation was computed. [2020-12-23 04:22:42,663 INFO L189 CegarLoopUtils]: For program point L430(lines 430 880) no Hoare annotation was computed. [2020-12-23 04:22:42,663 INFO L189 CegarLoopUtils]: For program point L166-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,663 INFO L189 CegarLoopUtils]: For program point L100-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,663 INFO L189 CegarLoopUtils]: For program point L34-1(lines 30 882) no Hoare annotation was computed. [2020-12-23 04:22:42,663 INFO L189 CegarLoopUtils]: For program point L233(lines 233 880) no Hoare annotation was computed. [2020-12-23 04:22:42,663 INFO L189 CegarLoopUtils]: For program point L167(line 167) no Hoare annotation was computed. [2020-12-23 04:22:42,663 INFO L189 CegarLoopUtils]: For program point L101(line 101) no Hoare annotation was computed. [2020-12-23 04:22:42,663 INFO L189 CegarLoopUtils]: For program point L35(line 35) no Hoare annotation was computed. [2020-12-23 04:22:42,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 04:22:42 BoogieIcfgContainer [2020-12-23 04:22:42,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 04:22:42,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 04:22:42,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 04:22:42,693 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 04:22:42,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:21:27" (3/4) ... [2020-12-23 04:22:42,697 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 04:22:42,734 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-23 04:22:42,736 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-23 04:22:42,737 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 04:22:42,739 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 04:22:42,913 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem14_label46.c-witness.graphml [2020-12-23 04:22:42,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 04:22:42,914 INFO L168 Benchmark]: Toolchain (without parser) took 78451.86 ms. Allocated memory was 151.0 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 124.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. [2020-12-23 04:22:42,915 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 151.0 MB. Free memory was 123.2 MB in the beginning and 123.1 MB in the end (delta: 96.0 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 04:22:42,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 994.60 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 122.8 MB in the end (delta: 909.6 kB). Peak memory consumption was 26.6 MB. Max. memory is 8.0 GB. [2020-12-23 04:22:42,916 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.18 ms. Allocated memory is still 151.0 MB. Free memory was 122.8 MB in the beginning and 113.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-12-23 04:22:42,916 INFO L168 Benchmark]: Boogie Preprocessor took 88.91 ms. Allocated memory is still 151.0 MB. Free memory was 113.3 MB in the beginning and 106.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2020-12-23 04:22:42,917 INFO L168 Benchmark]: RCFGBuilder took 1900.30 ms. Allocated memory is still 151.0 MB. Free memory was 106.5 MB in the beginning and 60.4 MB in the end (delta: 46.1 MB). Peak memory consumption was 67.1 MB. Max. memory is 8.0 GB. [2020-12-23 04:22:42,917 INFO L168 Benchmark]: TraceAbstraction took 75130.47 ms. Allocated memory was 151.0 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 59.9 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 957.3 MB. Max. memory is 8.0 GB. [2020-12-23 04:22:42,917 INFO L168 Benchmark]: Witness Printer took 220.54 ms. Allocated memory is still 2.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 19.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2020-12-23 04:22:42,919 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.20 ms. Allocated memory is still 151.0 MB. Free memory was 123.2 MB in the beginning and 123.1 MB in the end (delta: 96.0 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 994.60 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 122.8 MB in the end (delta: 909.6 kB). Peak memory consumption was 26.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 107.18 ms. Allocated memory is still 151.0 MB. Free memory was 122.8 MB in the beginning and 113.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 88.91 ms. Allocated memory is still 151.0 MB. Free memory was 113.3 MB in the beginning and 106.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1900.30 ms. Allocated memory is still 151.0 MB. Free memory was 106.5 MB in the beginning and 60.4 MB in the end (delta: 46.1 MB). Peak memory consumption was 67.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 75130.47 ms. Allocated memory was 151.0 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 59.9 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 957.3 MB. Max. memory is 8.0 GB. * Witness Printer took 220.54 ms. Allocated memory is still 2.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 19.4 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: 131]: 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: ((((((((((((((((((((0 <= a12 + 42 && 8 <= a21) && a24 == 1) && 9 <= a15) && a12 <= 73282) && a21 <= 8) || ((((7 <= a21 && ((a12 + -600066) / 5 + 14 <= 0 || (a12 + 4 == (a12 + 4) / 5 * 5 && (a12 + -600066) / 5 + 13 <= 0))) && 23 <= a12) && a24 == 1) && 9 <= a15)) || (((((a21 <= 7 && 7 <= a21) && 0 <= a12 + 42) && a12 <= 11) && a24 == 1) && a15 <= 8)) || (((5 == a15 && a21 <= 7) && a24 <= 1) && a12 <= 11)) || ((a21 <= 7 && a15 <= 7) && a24 == 1)) || (((a12 + -600066) / 5 + 14 <= 0 || (a12 + 4 == (a12 + 4) / 5 * 5 && (a12 + -600066) / 5 + 13 <= 0)) && ((((a24 == 1 && 11 < a12) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && 10 <= a21)))) || ((9 <= a21 && a15 <= 7) && a24 == 1)) || ((((8 <= a21 && a24 == 1) && 9 <= a15) && a12 + 526767 <= 0) && a21 <= 8)) || ((((9 <= a21 && a24 == 1) && 11 < a12) && a15 <= 8) && a12 <= 76)) || ((((9 <= a21 && 0 <= a12 + 42) && a12 <= 11) && a24 == 1) && a15 <= 8)) || (((23 <= a12 && a12 <= 586307) && a24 == 1) && a21 <= 6)) || (((((a15 <= 7 && 8 <= a21) && a24 == 1) && 11 < a12) && a15 <= 8) && a21 <= 8)) || ((((a21 <= 7 && 7 <= a21) && a12 + 49 <= 0) && a24 == 1) && a15 <= 8)) || (((((8 <= a21 && a24 == 1) && 11 < a12) && a15 <= 8) && a12 <= 73282) && a21 <= 8)) || ((a12 <= 11 && a24 == 1) && 10 <= a21)) || ((7 == a15 && a24 == 1) && a12 + 44 <= 0)) || ((a15 <= 7 && a12 <= 11) && a21 <= 6) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 <= a12 + 42 && 8 <= a21) && a24 == 1) && 9 <= a15) && a12 <= 73282) && a21 <= 8) || ((((7 <= a21 && ((a12 + -600066) / 5 + 14 <= 0 || (a12 + 4 == (a12 + 4) / 5 * 5 && (a12 + -600066) / 5 + 13 <= 0))) && 23 <= a12) && a24 == 1) && 9 <= a15)) || (((((a21 <= 7 && 7 <= a21) && 0 <= a12 + 42) && a12 <= 11) && a24 == 1) && a15 <= 8)) || (((5 == a15 && a21 <= 7) && a24 <= 1) && a12 <= 11)) || ((a21 <= 7 && a15 <= 7) && a24 == 1)) || (((a12 + -600066) / 5 + 14 <= 0 || (a12 + 4 == (a12 + 4) / 5 * 5 && (a12 + -600066) / 5 + 13 <= 0)) && ((((a24 == 1 && 11 < a12) && a15 <= 8) && a21 <= 6) || ((a24 == 1 && a15 <= 8) && 10 <= a21)))) || ((9 <= a21 && a15 <= 7) && a24 == 1)) || ((((8 <= a21 && a24 == 1) && 9 <= a15) && a12 + 526767 <= 0) && a21 <= 8)) || ((((9 <= a21 && a24 == 1) && 11 < a12) && a15 <= 8) && a12 <= 76)) || ((((9 <= a21 && 0 <= a12 + 42) && a12 <= 11) && a24 == 1) && a15 <= 8)) || (((23 <= a12 && a12 <= 586307) && a24 == 1) && a21 <= 6)) || (((((a15 <= 7 && 8 <= a21) && a24 == 1) && 11 < a12) && a15 <= 8) && a21 <= 8)) || ((((a21 <= 7 && 7 <= a21) && a12 + 49 <= 0) && a24 == 1) && a15 <= 8)) || (((((8 <= a21 && a24 == 1) && 11 < a12) && a15 <= 8) && a12 <= 73282) && a21 <= 8)) || ((a12 <= 11 && a24 == 1) && 10 <= a21)) || ((7 == a15 && a24 == 1) && a12 + 44 <= 0)) || ((a15 <= 7 && a12 <= 11) && a21 <= 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 71.4s, OverallIterations: 25, TraceHistogramMax: 18, AutomataDifference: 23.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3283 SDtfs, 3109 SDslu, 153 SDs, 0 SdLazy, 13922 SolverSat, 1457 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7589 GetRequests, 7532 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5878occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 3204 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 103 NumberOfFragments, 659 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1468 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 5464 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 27841 NumberOfCodeBlocks, 27841 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 27808 ConstructedInterpolants, 0 QuantifiedInterpolants, 85478769 SizeOfPredicates, 0 NumberOfNonLiveVariables, 9453 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 33 InterpolantComputations, 24 PerfectInterpolantSequences, 104221/106517 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...