/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_label09.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 04:17:33,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 04:17:33,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 04:17:33,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 04:17:33,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 04:17:33,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 04:17:33,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 04:17:33,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 04:17:33,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 04:17:33,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 04:17:33,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 04:17:33,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 04:17:33,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 04:17:33,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 04:17:33,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 04:17:33,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 04:17:33,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 04:17:33,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 04:17:33,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 04:17:33,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 04:17:33,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 04:17:33,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 04:17:33,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 04:17:33,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 04:17:33,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 04:17:33,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 04:17:33,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 04:17:33,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 04:17:33,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 04:17:33,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 04:17:33,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 04:17:33,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 04:17:33,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 04:17:33,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 04:17:33,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 04:17:33,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 04:17:33,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 04:17:33,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 04:17:33,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 04:17:33,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 04:17:33,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 04:17:33,794 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:17:33,848 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 04:17:33,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 04:17:33,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 04:17:33,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 04:17:33,855 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 04:17:33,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 04:17:33,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 04:17:33,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 04:17:33,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 04:17:33,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 04:17:33,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 04:17:33,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 04:17:33,859 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 04:17:33,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 04:17:33,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 04:17:33,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 04:17:33,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 04:17:33,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 04:17:33,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 04:17:33,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 04:17:33,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 04:17:33,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 04:17:33,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 04:17:33,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 04:17:33,862 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 04:17:33,863 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:17:34,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 04:17:34,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 04:17:34,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 04:17:34,425 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 04:17:34,426 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 04:17:34,428 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label09.c [2020-12-23 04:17:34,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/887b859eb/8a3c745b925b4130a975a75b5f8d13fc/FLAG3da86040d [2020-12-23 04:17:35,398 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 04:17:35,399 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label09.c [2020-12-23 04:17:35,414 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/887b859eb/8a3c745b925b4130a975a75b5f8d13fc/FLAG3da86040d [2020-12-23 04:17:35,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/887b859eb/8a3c745b925b4130a975a75b5f8d13fc [2020-12-23 04:17:35,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 04:17:35,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 04:17:35,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 04:17:35,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 04:17:35,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 04:17:35,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:17:35" (1/1) ... [2020-12-23 04:17:35,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73126137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:35, skipping insertion in model container [2020-12-23 04:17:35,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:17:35" (1/1) ... [2020-12-23 04:17:35,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 04:17:35,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 04:17:35,877 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_label09.c[4722,4735] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: 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:17:36,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 04:17:36,204 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 04:17:36,235 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_label09.c[4722,4735] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: 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:17:36,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 04:17:36,478 INFO L208 MainTranslator]: Completed translation [2020-12-23 04:17:36,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:36 WrapperNode [2020-12-23 04:17:36,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 04:17:36,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 04:17:36,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 04:17:36,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 04:17:36,489 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:17:36" (1/1) ... [2020-12-23 04:17:36,517 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:17:36" (1/1) ... [2020-12-23 04:17:36,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 04:17:36,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 04:17:36,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 04:17:36,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 04:17:36,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:36" (1/1) ... [2020-12-23 04:17:36,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:36" (1/1) ... [2020-12-23 04:17:36,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:36" (1/1) ... [2020-12-23 04:17:36,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:36" (1/1) ... [2020-12-23 04:17:36,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:36" (1/1) ... [2020-12-23 04:17:36,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:36" (1/1) ... [2020-12-23 04:17:36,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:36" (1/1) ... [2020-12-23 04:17:36,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 04:17:36,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 04:17:36,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 04:17:36,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 04:17:36,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:36" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 04:17:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 04:17:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 04:17:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 04:17:36,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 04:17:38,879 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 04:17:38,880 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 04:17:38,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:17:38 BoogieIcfgContainer [2020-12-23 04:17:38,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 04:17:38,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 04:17:38,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 04:17:38,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 04:17:38,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 04:17:35" (1/3) ... [2020-12-23 04:17:38,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a41a87b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:17:38, skipping insertion in model container [2020-12-23 04:17:38,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:17:36" (2/3) ... [2020-12-23 04:17:38,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a41a87b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:17:38, skipping insertion in model container [2020-12-23 04:17:38,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:17:38" (3/3) ... [2020-12-23 04:17:38,902 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label09.c [2020-12-23 04:17:38,911 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 04:17:38,917 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 04:17:38,940 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 04:17:38,989 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 04:17:38,989 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 04:17:38,989 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 04:17:38,989 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 04:17:38,989 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 04:17:38,990 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 04:17:38,990 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 04:17:38,990 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 04:17:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2020-12-23 04:17:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 04:17:39,026 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:17:39,027 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, 1, 1, 1, 1, 1, 1] [2020-12-23 04:17:39,028 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:17:39,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:17:39,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2020-12-23 04:17:39,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:17:39,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113585027] [2020-12-23 04:17:39,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:17:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:17:39,379 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:17:39,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113585027] [2020-12-23 04:17:39,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:17:39,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 04:17:39,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266482036] [2020-12-23 04:17:39,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:17:39,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:17:39,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:17:39,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:17:39,414 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 3 states. [2020-12-23 04:17:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:17:41,047 INFO L93 Difference]: Finished difference Result 669 states and 1200 transitions. [2020-12-23 04:17:41,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:17:41,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-23 04:17:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:17:41,068 INFO L225 Difference]: With dead ends: 669 [2020-12-23 04:17:41,069 INFO L226 Difference]: Without dead ends: 360 [2020-12-23 04:17:41,075 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:17:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2020-12-23 04:17:41,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2020-12-23 04:17:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-12-23 04:17:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 588 transitions. [2020-12-23 04:17:41,165 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 588 transitions. Word has length 45 [2020-12-23 04:17:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:17:41,166 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 588 transitions. [2020-12-23 04:17:41,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:17:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 588 transitions. [2020-12-23 04:17:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-23 04:17:41,174 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:17:41,175 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, 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] [2020-12-23 04:17:41,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 04:17:41,176 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:17:41,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:17:41,179 INFO L82 PathProgramCache]: Analyzing trace with hash 661504820, now seen corresponding path program 1 times [2020-12-23 04:17:41,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:17:41,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708466856] [2020-12-23 04:17:41,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:17:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:17:41,455 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:17:41,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708466856] [2020-12-23 04:17:41,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:17:41,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 04:17:41,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997525158] [2020-12-23 04:17:41,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:17:41,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:17:41,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:17:41,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:17:41,460 INFO L87 Difference]: Start difference. First operand 360 states and 588 transitions. Second operand 3 states. [2020-12-23 04:17:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:17:42,581 INFO L93 Difference]: Finished difference Result 1074 states and 1759 transitions. [2020-12-23 04:17:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:17:42,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2020-12-23 04:17:42,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:17:42,593 INFO L225 Difference]: With dead ends: 1074 [2020-12-23 04:17:42,593 INFO L226 Difference]: Without dead ends: 716 [2020-12-23 04:17:42,598 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:17:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-12-23 04:17:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2020-12-23 04:17:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2020-12-23 04:17:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1089 transitions. [2020-12-23 04:17:42,655 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1089 transitions. Word has length 110 [2020-12-23 04:17:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:17:42,657 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 1089 transitions. [2020-12-23 04:17:42,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:17:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1089 transitions. [2020-12-23 04:17:42,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 04:17:42,666 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:17:42,666 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, 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:17:42,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 04:17:42,667 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:17:42,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:17:42,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2053539673, now seen corresponding path program 1 times [2020-12-23 04:17:42,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:17:42,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079100675] [2020-12-23 04:17:42,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:17:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:17:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:17:42,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079100675] [2020-12-23 04:17:42,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:17:42,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 04:17:42,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225530429] [2020-12-23 04:17:42,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:17:42,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:17:42,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:17:42,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:17:42,874 INFO L87 Difference]: Start difference. First operand 716 states and 1089 transitions. Second operand 3 states. [2020-12-23 04:17:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:17:43,969 INFO L93 Difference]: Finished difference Result 1786 states and 2718 transitions. [2020-12-23 04:17:43,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:17:43,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-12-23 04:17:43,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:17:43,978 INFO L225 Difference]: With dead ends: 1786 [2020-12-23 04:17:43,979 INFO L226 Difference]: Without dead ends: 1072 [2020-12-23 04:17:43,981 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:17:43,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2020-12-23 04:17:44,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2020-12-23 04:17:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2020-12-23 04:17:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1475 transitions. [2020-12-23 04:17:44,016 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1475 transitions. Word has length 111 [2020-12-23 04:17:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:17:44,017 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1475 transitions. [2020-12-23 04:17:44,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:17:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1475 transitions. [2020-12-23 04:17:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-23 04:17:44,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:17:44,019 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, 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:17:44,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 04:17:44,020 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:17:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:17:44,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1476660258, now seen corresponding path program 1 times [2020-12-23 04:17:44,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:17:44,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608547991] [2020-12-23 04:17:44,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:17:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:17:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:17:44,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608547991] [2020-12-23 04:17:44,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:17:44,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 04:17:44,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339407811] [2020-12-23 04:17:44,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:17:44,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:17:44,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:17:44,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:17:44,165 INFO L87 Difference]: Start difference. First operand 1072 states and 1475 transitions. Second operand 3 states. [2020-12-23 04:17:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:17:45,286 INFO L93 Difference]: Finished difference Result 2854 states and 3878 transitions. [2020-12-23 04:17:45,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:17:45,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-12-23 04:17:45,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:17:45,303 INFO L225 Difference]: With dead ends: 2854 [2020-12-23 04:17:45,304 INFO L226 Difference]: Without dead ends: 1784 [2020-12-23 04:17:45,307 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:17:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2020-12-23 04:17:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1428. [2020-12-23 04:17:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2020-12-23 04:17:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1873 transitions. [2020-12-23 04:17:45,352 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1873 transitions. Word has length 113 [2020-12-23 04:17:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:17:45,352 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 1873 transitions. [2020-12-23 04:17:45,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:17:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1873 transitions. [2020-12-23 04:17:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-23 04:17:45,354 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:17:45,354 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:17:45,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 04:17:45,355 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:17:45,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:17:45,356 INFO L82 PathProgramCache]: Analyzing trace with hash 475715383, now seen corresponding path program 1 times [2020-12-23 04:17:45,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:17:45,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839774809] [2020-12-23 04:17:45,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:17:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:17:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:17:45,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839774809] [2020-12-23 04:17:45,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:17:45,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:17:45,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91586176] [2020-12-23 04:17:45,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:17:45,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:17:45,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:17:45,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:17:45,596 INFO L87 Difference]: Start difference. First operand 1428 states and 1873 transitions. Second operand 4 states. [2020-12-23 04:17:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:17:47,294 INFO L93 Difference]: Finished difference Result 3388 states and 4344 transitions. [2020-12-23 04:17:47,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:17:47,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2020-12-23 04:17:47,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:17:47,308 INFO L225 Difference]: With dead ends: 3388 [2020-12-23 04:17:47,308 INFO L226 Difference]: Without dead ends: 1962 [2020-12-23 04:17:47,312 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:17:47,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-12-23 04:17:47,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2020-12-23 04:17:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2020-12-23 04:17:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2247 transitions. [2020-12-23 04:17:47,371 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2247 transitions. Word has length 124 [2020-12-23 04:17:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:17:47,372 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2247 transitions. [2020-12-23 04:17:47,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:17:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2247 transitions. [2020-12-23 04:17:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-12-23 04:17:47,375 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:17:47,376 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, 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, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:17:47,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 04:17:47,376 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:17:47,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:17:47,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2015485732, now seen corresponding path program 1 times [2020-12-23 04:17:47,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:17:47,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625280224] [2020-12-23 04:17:47,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:17:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:17:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 04:17:47,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625280224] [2020-12-23 04:17:47,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:17:47,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:17:47,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697063827] [2020-12-23 04:17:47,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:17:47,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:17:47,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:17:47,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:17:47,648 INFO L87 Difference]: Start difference. First operand 1784 states and 2247 transitions. Second operand 4 states. [2020-12-23 04:17:48,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:17:48,865 INFO L93 Difference]: Finished difference Result 3773 states and 4735 transitions. [2020-12-23 04:17:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:17:48,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2020-12-23 04:17:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:17:48,878 INFO L225 Difference]: With dead ends: 3773 [2020-12-23 04:17:48,878 INFO L226 Difference]: Without dead ends: 2140 [2020-12-23 04:17:48,882 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:17:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2020-12-23 04:17:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2020-12-23 04:17:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2020-12-23 04:17:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2434 transitions. [2020-12-23 04:17:48,937 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2434 transitions. Word has length 204 [2020-12-23 04:17:48,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:17:48,937 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2434 transitions. [2020-12-23 04:17:48,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:17:48,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2434 transitions. [2020-12-23 04:17:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2020-12-23 04:17:48,943 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:17:48,944 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:17:48,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 04:17:48,944 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:17:48,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:17:48,945 INFO L82 PathProgramCache]: Analyzing trace with hash 550723459, now seen corresponding path program 1 times [2020-12-23 04:17:48,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:17:48,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894563991] [2020-12-23 04:17:48,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:17:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:17:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 239 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:17:49,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894563991] [2020-12-23 04:17:49,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702472234] [2020-12-23 04:17:49,577 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:17:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:17:49,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:17:49,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:17:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-23 04:17:50,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:17:50,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2020-12-23 04:17:50,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103303374] [2020-12-23 04:17:50,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:17:50,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:17:50,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:17:50,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 04:17:50,685 INFO L87 Difference]: Start difference. First operand 2140 states and 2434 transitions. Second operand 4 states. [2020-12-23 04:17:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:17:51,948 INFO L93 Difference]: Finished difference Result 4100 states and 4687 transitions. [2020-12-23 04:17:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:17:51,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 325 [2020-12-23 04:17:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:17:51,962 INFO L225 Difference]: With dead ends: 4100 [2020-12-23 04:17:51,962 INFO L226 Difference]: Without dead ends: 2140 [2020-12-23 04:17:51,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 04:17:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2020-12-23 04:17:52,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2020-12-23 04:17:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2020-12-23 04:17:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2415 transitions. [2020-12-23 04:17:52,022 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2415 transitions. Word has length 325 [2020-12-23 04:17:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:17:52,023 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2415 transitions. [2020-12-23 04:17:52,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:17:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2415 transitions. [2020-12-23 04:17:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2020-12-23 04:17:52,030 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:17:52,030 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, 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, 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:17:52,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 04:17:52,244 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:17:52,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:17:52,245 INFO L82 PathProgramCache]: Analyzing trace with hash -25009412, now seen corresponding path program 1 times [2020-12-23 04:17:52,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:17:52,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030948982] [2020-12-23 04:17:52,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:17:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:17:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-23 04:17:52,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030948982] [2020-12-23 04:17:52,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:17:52,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:17:52,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873031564] [2020-12-23 04:17:52,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:17:52,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:17:52,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:17:52,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:17:52,657 INFO L87 Difference]: Start difference. First operand 2140 states and 2415 transitions. Second operand 3 states. [2020-12-23 04:17:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:17:53,693 INFO L93 Difference]: Finished difference Result 4634 states and 5266 transitions. [2020-12-23 04:17:53,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:17:53,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2020-12-23 04:17:53,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:17:53,710 INFO L225 Difference]: With dead ends: 4634 [2020-12-23 04:17:53,710 INFO L226 Difference]: Without dead ends: 2674 [2020-12-23 04:17:53,716 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:17:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2020-12-23 04:17:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2496. [2020-12-23 04:17:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2020-12-23 04:17:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2810 transitions. [2020-12-23 04:17:53,788 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2810 transitions. Word has length 335 [2020-12-23 04:17:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:17:53,789 INFO L481 AbstractCegarLoop]: Abstraction has 2496 states and 2810 transitions. [2020-12-23 04:17:53,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:17:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2810 transitions. [2020-12-23 04:17:53,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2020-12-23 04:17:53,796 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:17:53,797 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, 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, 2, 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:17:53,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 04:17:53,797 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:17:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:17:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash -841281577, now seen corresponding path program 1 times [2020-12-23 04:17:53,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:17:53,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316848916] [2020-12-23 04:17:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:17:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:17:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2020-12-23 04:17:54,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316848916] [2020-12-23 04:17:54,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:17:54,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:17:54,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918516097] [2020-12-23 04:17:54,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:17:54,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:17:54,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:17:54,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:17:54,218 INFO L87 Difference]: Start difference. First operand 2496 states and 2810 transitions. Second operand 4 states. [2020-12-23 04:17:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:17:55,284 INFO L93 Difference]: Finished difference Result 5048 states and 5687 transitions. [2020-12-23 04:17:55,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:17:55,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2020-12-23 04:17:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:17:55,313 INFO L225 Difference]: With dead ends: 5048 [2020-12-23 04:17:55,313 INFO L226 Difference]: Without dead ends: 2674 [2020-12-23 04:17:55,319 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:17:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2020-12-23 04:17:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2496. [2020-12-23 04:17:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2020-12-23 04:17:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2707 transitions. [2020-12-23 04:17:55,384 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2707 transitions. Word has length 336 [2020-12-23 04:17:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:17:55,385 INFO L481 AbstractCegarLoop]: Abstraction has 2496 states and 2707 transitions. [2020-12-23 04:17:55,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:17:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2707 transitions. [2020-12-23 04:17:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2020-12-23 04:17:55,395 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:17:55,396 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 04:17:55,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 04:17:55,396 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:17:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:17:55,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1026613071, now seen corresponding path program 2 times [2020-12-23 04:17:55,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:17:55,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614553580] [2020-12-23 04:17:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:17:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:17:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 391 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-12-23 04:17:56,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614553580] [2020-12-23 04:17:56,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242643036] [2020-12-23 04:17:56,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17:56,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 04:17:56,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 04:17:56,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 04:17:56,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:17:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 284 proven. 93 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:17:57,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 04:17:57,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2020-12-23 04:17:57,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506593631] [2020-12-23 04:17:57,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 04:17:57,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:17:57,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 04:17:57,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 04:17:57,452 INFO L87 Difference]: Start difference. First operand 2496 states and 2707 transitions. Second operand 9 states. [2020-12-23 04:18:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:00,461 INFO L93 Difference]: Finished difference Result 5533 states and 6009 transitions. [2020-12-23 04:18:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 04:18:00,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 431 [2020-12-23 04:18:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:00,478 INFO L225 Difference]: With dead ends: 5533 [2020-12-23 04:18:00,478 INFO L226 Difference]: Without dead ends: 3217 [2020-12-23 04:18:00,482 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-12-23 04:18:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2020-12-23 04:18:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 2140. [2020-12-23 04:18:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2020-12-23 04:18:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2331 transitions. [2020-12-23 04:18:00,550 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2331 transitions. Word has length 431 [2020-12-23 04:18:00,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:00,551 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2331 transitions. [2020-12-23 04:18:00,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 04:18:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2331 transitions. [2020-12-23 04:18:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2020-12-23 04:18:00,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:00,564 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:18:00,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 04:18:00,780 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:00,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:00,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1829033834, now seen corresponding path program 1 times [2020-12-23 04:18:00,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:00,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437207982] [2020-12-23 04:18:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:18:01,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437207982] [2020-12-23 04:18:01,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:01,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:18:01,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039408450] [2020-12-23 04:18:01,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:01,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:01,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:01,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:01,246 INFO L87 Difference]: Start difference. First operand 2140 states and 2331 transitions. Second operand 3 states. [2020-12-23 04:18:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:02,184 INFO L93 Difference]: Finished difference Result 5168 states and 5666 transitions. [2020-12-23 04:18:02,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:02,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2020-12-23 04:18:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:02,201 INFO L225 Difference]: With dead ends: 5168 [2020-12-23 04:18:02,201 INFO L226 Difference]: Without dead ends: 3030 [2020-12-23 04:18:02,205 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:18:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2020-12-23 04:18:02,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 3030. [2020-12-23 04:18:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2020-12-23 04:18:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3283 transitions. [2020-12-23 04:18:02,286 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3283 transitions. Word has length 438 [2020-12-23 04:18:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:02,287 INFO L481 AbstractCegarLoop]: Abstraction has 3030 states and 3283 transitions. [2020-12-23 04:18:02,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3283 transitions. [2020-12-23 04:18:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2020-12-23 04:18:02,292 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:02,292 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, 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, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:18:02,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 04:18:02,293 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:02,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:02,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1313117521, now seen corresponding path program 1 times [2020-12-23 04:18:02,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:02,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607389743] [2020-12-23 04:18:02,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:18:02,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607389743] [2020-12-23 04:18:02,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:02,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:18:02,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135043714] [2020-12-23 04:18:02,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:02,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:02,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:02,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:02,794 INFO L87 Difference]: Start difference. First operand 3030 states and 3283 transitions. Second operand 3 states. [2020-12-23 04:18:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:03,688 INFO L93 Difference]: Finished difference Result 7660 states and 8355 transitions. [2020-12-23 04:18:03,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:03,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 479 [2020-12-23 04:18:03,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:03,711 INFO L225 Difference]: With dead ends: 7660 [2020-12-23 04:18:03,712 INFO L226 Difference]: Without dead ends: 4632 [2020-12-23 04:18:03,718 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:18:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2020-12-23 04:18:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2020-12-23 04:18:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2020-12-23 04:18:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4786 transitions. [2020-12-23 04:18:03,836 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4786 transitions. Word has length 479 [2020-12-23 04:18:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:03,838 INFO L481 AbstractCegarLoop]: Abstraction has 4454 states and 4786 transitions. [2020-12-23 04:18:03,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4786 transitions. [2020-12-23 04:18:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2020-12-23 04:18:03,849 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:03,850 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, 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, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:03,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 04:18:03,850 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:03,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:03,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1713531829, now seen corresponding path program 1 times [2020-12-23 04:18:03,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:03,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010302522] [2020-12-23 04:18:03,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:18:04,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010302522] [2020-12-23 04:18:04,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262066136] [2020-12-23 04:18:04,764 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:18:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:05,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:18:05,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:18:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:18:06,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 04:18:06,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 04:18:06,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196601606] [2020-12-23 04:18:06,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:18:06,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:06,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:18:06,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:18:06,146 INFO L87 Difference]: Start difference. First operand 4454 states and 4786 transitions. Second operand 4 states. [2020-12-23 04:18:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:07,416 INFO L93 Difference]: Finished difference Result 10154 states and 10932 transitions. [2020-12-23 04:18:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:18:07,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 634 [2020-12-23 04:18:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:07,446 INFO L225 Difference]: With dead ends: 10154 [2020-12-23 04:18:07,446 INFO L226 Difference]: Without dead ends: 5702 [2020-12-23 04:18:07,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 635 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:18:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2020-12-23 04:18:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 5344. [2020-12-23 04:18:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2020-12-23 04:18:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5740 transitions. [2020-12-23 04:18:07,594 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5740 transitions. Word has length 634 [2020-12-23 04:18:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:07,596 INFO L481 AbstractCegarLoop]: Abstraction has 5344 states and 5740 transitions. [2020-12-23 04:18:07,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:18:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5740 transitions. [2020-12-23 04:18:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2020-12-23 04:18:07,606 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:07,607 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, 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, 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, 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] [2020-12-23 04:18:07,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 04:18:07,823 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:07,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:07,825 INFO L82 PathProgramCache]: Analyzing trace with hash 223844596, now seen corresponding path program 1 times [2020-12-23 04:18:07,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:07,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155623952] [2020-12-23 04:18:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 1060 proven. 260 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2020-12-23 04:18:09,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155623952] [2020-12-23 04:18:09,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817572245] [2020-12-23 04:18:09,092 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:18:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:09,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:18:09,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:18:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 1111 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2020-12-23 04:18:10,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:18:10,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2020-12-23 04:18:10,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684473015] [2020-12-23 04:18:10,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:10,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:10,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:10,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:18:10,573 INFO L87 Difference]: Start difference. First operand 5344 states and 5740 transitions. Second operand 3 states. [2020-12-23 04:18:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:11,438 INFO L93 Difference]: Finished difference Result 10864 states and 11681 transitions. [2020-12-23 04:18:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:11,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 644 [2020-12-23 04:18:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:11,470 INFO L225 Difference]: With dead ends: 10864 [2020-12-23 04:18:11,470 INFO L226 Difference]: Without dead ends: 5522 [2020-12-23 04:18:11,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:18:11,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2020-12-23 04:18:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 4988. [2020-12-23 04:18:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2020-12-23 04:18:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5358 transitions. [2020-12-23 04:18:11,586 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5358 transitions. Word has length 644 [2020-12-23 04:18:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:11,588 INFO L481 AbstractCegarLoop]: Abstraction has 4988 states and 5358 transitions. [2020-12-23 04:18:11,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5358 transitions. [2020-12-23 04:18:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2020-12-23 04:18:11,595 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:11,596 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, 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, 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, 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:18:11,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:18:11,811 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:11,812 INFO L82 PathProgramCache]: Analyzing trace with hash -248319062, now seen corresponding path program 1 times [2020-12-23 04:18:11,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:11,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155670165] [2020-12-23 04:18:11,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1003 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2020-12-23 04:18:12,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155670165] [2020-12-23 04:18:12,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:12,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:18:12,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513972383] [2020-12-23 04:18:12,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:12,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:12,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:12,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:12,534 INFO L87 Difference]: Start difference. First operand 4988 states and 5358 transitions. Second operand 3 states. [2020-12-23 04:18:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:13,437 INFO L93 Difference]: Finished difference Result 11220 states and 12126 transitions. [2020-12-23 04:18:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:13,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 706 [2020-12-23 04:18:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:13,455 INFO L225 Difference]: With dead ends: 11220 [2020-12-23 04:18:13,455 INFO L226 Difference]: Without dead ends: 6234 [2020-12-23 04:18:13,464 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:18:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2020-12-23 04:18:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 5878. [2020-12-23 04:18:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2020-12-23 04:18:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6343 transitions. [2020-12-23 04:18:13,587 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6343 transitions. Word has length 706 [2020-12-23 04:18:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:13,588 INFO L481 AbstractCegarLoop]: Abstraction has 5878 states and 6343 transitions. [2020-12-23 04:18:13,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6343 transitions. [2020-12-23 04:18:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2020-12-23 04:18:13,597 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:13,598 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, 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:18:13,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 04:18:13,599 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:13,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1255761865, now seen corresponding path program 1 times [2020-12-23 04:18:13,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:13,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216506478] [2020-12-23 04:18:13,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1118 proven. 93 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2020-12-23 04:18:14,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216506478] [2020-12-23 04:18:14,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797273135] [2020-12-23 04:18:14,818 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:18:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:15,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:18:15,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:18:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1211 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2020-12-23 04:18:16,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:18:16,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-12-23 04:18:16,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180235360] [2020-12-23 04:18:16,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:16,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:16,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:16,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:18:16,234 INFO L87 Difference]: Start difference. First operand 5878 states and 6343 transitions. Second operand 3 states. [2020-12-23 04:18:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:17,018 INFO L93 Difference]: Finished difference Result 12110 states and 13046 transitions. [2020-12-23 04:18:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:17,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 724 [2020-12-23 04:18:17,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:17,037 INFO L225 Difference]: With dead ends: 12110 [2020-12-23 04:18:17,037 INFO L226 Difference]: Without dead ends: 6234 [2020-12-23 04:18:17,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 723 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:18:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2020-12-23 04:18:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 5878. [2020-12-23 04:18:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2020-12-23 04:18:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6343 transitions. [2020-12-23 04:18:17,182 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6343 transitions. Word has length 724 [2020-12-23 04:18:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:17,183 INFO L481 AbstractCegarLoop]: Abstraction has 5878 states and 6343 transitions. [2020-12-23 04:18:17,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6343 transitions. [2020-12-23 04:18:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2020-12-23 04:18:17,195 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:17,195 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, 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, 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] [2020-12-23 04:18:17,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 04:18:17,408 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:17,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:17,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1244517444, now seen corresponding path program 1 times [2020-12-23 04:18:17,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:17,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130466019] [2020-12-23 04:18:17,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:18,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1716 backedges. 1036 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2020-12-23 04:18:18,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130466019] [2020-12-23 04:18:18,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:18,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:18:18,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117176564] [2020-12-23 04:18:18,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:18,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:18,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:18,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:18,512 INFO L87 Difference]: Start difference. First operand 5878 states and 6343 transitions. Second operand 3 states. [2020-12-23 04:18:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:19,374 INFO L93 Difference]: Finished difference Result 11932 states and 12869 transitions. [2020-12-23 04:18:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:19,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 751 [2020-12-23 04:18:19,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:19,393 INFO L225 Difference]: With dead ends: 11932 [2020-12-23 04:18:19,393 INFO L226 Difference]: Without dead ends: 6056 [2020-12-23 04:18:19,403 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:18:19,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-12-23 04:18:19,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5700. [2020-12-23 04:18:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2020-12-23 04:18:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 6100 transitions. [2020-12-23 04:18:19,535 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 6100 transitions. Word has length 751 [2020-12-23 04:18:19,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:19,536 INFO L481 AbstractCegarLoop]: Abstraction has 5700 states and 6100 transitions. [2020-12-23 04:18:19,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 6100 transitions. [2020-12-23 04:18:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2020-12-23 04:18:19,548 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:19,549 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, 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, 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, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:19,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 04:18:19,549 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1327784350, now seen corresponding path program 1 times [2020-12-23 04:18:19,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:19,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656868643] [2020-12-23 04:18:19,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1166 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2020-12-23 04:18:20,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656868643] [2020-12-23 04:18:20,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719849572] [2020-12-23 04:18:20,645 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:18:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:20,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 04:18:20,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:18:21,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:18:21,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 04:18:21,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 04:18:21,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 04:18:21,964 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:22,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 04:18:22,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 04:18:22,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 04:18:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 879 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2020-12-23 04:18:22,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:18:22,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2020-12-23 04:18:22,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800816946] [2020-12-23 04:18:22,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:18:22,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:22,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:18:22,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:18:22,931 INFO L87 Difference]: Start difference. First operand 5700 states and 6100 transitions. Second operand 4 states. [2020-12-23 04:18:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:24,441 INFO L93 Difference]: Finished difference Result 13000 states and 13923 transitions. [2020-12-23 04:18:24,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:18:24,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 801 [2020-12-23 04:18:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:24,459 INFO L225 Difference]: With dead ends: 13000 [2020-12-23 04:18:24,459 INFO L226 Difference]: Without dead ends: 7302 [2020-12-23 04:18:24,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 800 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:18:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2020-12-23 04:18:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 6590. [2020-12-23 04:18:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6590 states. [2020-12-23 04:18:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 7051 transitions. [2020-12-23 04:18:24,607 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 7051 transitions. Word has length 801 [2020-12-23 04:18:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:24,609 INFO L481 AbstractCegarLoop]: Abstraction has 6590 states and 7051 transitions. [2020-12-23 04:18:24,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:18:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 7051 transitions. [2020-12-23 04:18:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2020-12-23 04:18:24,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:24,624 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:24,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 04:18:24,839 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:24,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash 580335584, now seen corresponding path program 1 times [2020-12-23 04:18:24,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:24,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522738111] [2020-12-23 04:18:24,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2218 backedges. 1202 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2020-12-23 04:18:25,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522738111] [2020-12-23 04:18:25,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196959019] [2020-12-23 04:18:25,896 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:18:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:26,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 04:18:26,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:18:26,978 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:18:26,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 04:18:26,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 04:18:27,047 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2218 backedges. 915 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2020-12-23 04:18:27,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:18:27,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2020-12-23 04:18:27,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440240669] [2020-12-23 04:18:27,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:18:27,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:27,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:18:27,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:18:27,711 INFO L87 Difference]: Start difference. First operand 6590 states and 7051 transitions. Second operand 4 states. [2020-12-23 04:18:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:29,130 INFO L93 Difference]: Finished difference Result 14068 states and 15028 transitions. [2020-12-23 04:18:29,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:18:29,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 834 [2020-12-23 04:18:29,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:29,148 INFO L225 Difference]: With dead ends: 14068 [2020-12-23 04:18:29,148 INFO L226 Difference]: Without dead ends: 7480 [2020-12-23 04:18:29,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 833 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:18:29,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7480 states. [2020-12-23 04:18:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7480 to 6590. [2020-12-23 04:18:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6590 states. [2020-12-23 04:18:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 7051 transitions. [2020-12-23 04:18:29,296 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 7051 transitions. Word has length 834 [2020-12-23 04:18:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:29,297 INFO L481 AbstractCegarLoop]: Abstraction has 6590 states and 7051 transitions. [2020-12-23 04:18:29,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:18:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 7051 transitions. [2020-12-23 04:18:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2020-12-23 04:18:29,309 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:29,309 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:29,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:18:29,525 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:29,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:29,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1968437427, now seen corresponding path program 1 times [2020-12-23 04:18:29,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:29,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423671239] [2020-12-23 04:18:29,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2219 backedges. 1203 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2020-12-23 04:18:30,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423671239] [2020-12-23 04:18:30,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357141663] [2020-12-23 04:18:30,666 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:18:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:30,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 04:18:31,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:18:31,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:18:31,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 04:18:31,926 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:31,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 04:18:32,077 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:32,221 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:32,367 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:32,559 INFO L757 QuantifierPusher]: Run 40 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:32,825 INFO L757 QuantifierPusher]: Run 50 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:33,237 INFO L757 QuantifierPusher]: Run 60 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:34,021 INFO L757 QuantifierPusher]: Run 70 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:34,432 INFO L757 QuantifierPusher]: Run 80 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:34,766 INFO L757 QuantifierPusher]: Run 90 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:35,408 INFO L757 QuantifierPusher]: Run 100 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:36,372 INFO L757 QuantifierPusher]: Run 110 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:37,594 INFO L757 QuantifierPusher]: Run 120 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:39,561 INFO L757 QuantifierPusher]: Run 130 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:40,784 INFO L757 QuantifierPusher]: Run 140 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:41,521 INFO L757 QuantifierPusher]: Run 150 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:42,568 INFO L757 QuantifierPusher]: Run 160 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:43,753 INFO L757 QuantifierPusher]: Run 170 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:44,901 INFO L757 QuantifierPusher]: Run 180 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:46,072 INFO L757 QuantifierPusher]: Run 190 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:48,144 INFO L757 QuantifierPusher]: Run 200 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:50,253 INFO L757 QuantifierPusher]: Run 210 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:52,597 INFO L757 QuantifierPusher]: Run 220 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:54,517 INFO L757 QuantifierPusher]: Run 230 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:56,106 INFO L757 QuantifierPusher]: Run 240 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:57,801 INFO L757 QuantifierPusher]: Run 250 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:18:59,698 INFO L757 QuantifierPusher]: Run 260 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:01,803 INFO L757 QuantifierPusher]: Run 270 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:04,045 INFO L757 QuantifierPusher]: Run 280 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:06,102 INFO L757 QuantifierPusher]: Run 290 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:08,648 INFO L757 QuantifierPusher]: Run 300 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:11,294 INFO L757 QuantifierPusher]: Run 310 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:13,699 INFO L757 QuantifierPusher]: Run 320 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:16,183 INFO L757 QuantifierPusher]: Run 330 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:18,909 INFO L757 QuantifierPusher]: Run 340 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:21,772 INFO L757 QuantifierPusher]: Run 350 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:24,603 INFO L757 QuantifierPusher]: Run 360 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:27,847 INFO L757 QuantifierPusher]: Run 370 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:31,486 INFO L757 QuantifierPusher]: Run 380 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:34,978 INFO L757 QuantifierPusher]: Run 390 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:38,640 INFO L757 QuantifierPusher]: Run 400 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:42,259 INFO L757 QuantifierPusher]: Run 410 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:46,512 INFO L757 QuantifierPusher]: Run 420 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:50,783 INFO L757 QuantifierPusher]: Run 430 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:55,156 INFO L757 QuantifierPusher]: Run 440 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:59,689 INFO L757 QuantifierPusher]: Run 450 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:04,893 INFO L757 QuantifierPusher]: Run 460 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:10,161 INFO L757 QuantifierPusher]: Run 470 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:15,731 INFO L757 QuantifierPusher]: Run 480 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:21,233 INFO L757 QuantifierPusher]: Run 490 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:26,814 INFO L757 QuantifierPusher]: Run 500 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:32,492 INFO L757 QuantifierPusher]: Run 510 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:38,598 INFO L757 QuantifierPusher]: Run 520 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:45,012 INFO L757 QuantifierPusher]: Run 530 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:51,936 INFO L757 QuantifierPusher]: Run 540 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:59,411 INFO L757 QuantifierPusher]: Run 550 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:06,914 INFO L757 QuantifierPusher]: Run 560 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:14,421 INFO L757 QuantifierPusher]: Run 570 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:22,017 INFO L757 QuantifierPusher]: Run 580 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:30,438 INFO L757 QuantifierPusher]: Run 590 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug.