/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_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 14:15:25,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 14:15:25,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 14:15:25,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 14:15:25,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 14:15:25,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 14:15:25,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 14:15:25,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 14:15:25,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 14:15:25,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 14:15:25,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 14:15:25,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 14:15:25,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 14:15:25,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 14:15:25,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 14:15:25,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 14:15:25,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 14:15:25,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 14:15:25,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 14:15:25,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 14:15:25,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 14:15:25,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 14:15:25,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 14:15:25,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 14:15:25,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 14:15:25,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 14:15:25,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 14:15:25,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 14:15:25,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 14:15:25,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 14:15:25,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 14:15:25,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 14:15:25,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 14:15:25,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 14:15:25,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 14:15:25,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 14:15:25,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 14:15:25,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 14:15:25,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 14:15:25,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 14:15:25,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 14:15:25,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 14:15:25,970 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 14:15:25,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 14:15:25,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 14:15:25,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 14:15:25,975 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 14:15:25,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 14:15:25,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 14:15:25,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 14:15:25,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 14:15:25,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 14:15:25,977 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 14:15:25,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 14:15:25,978 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 14:15:25,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 14:15:25,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 14:15:25,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 14:15:25,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 14:15:25,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 14:15:25,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 14:15:25,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 14:15:25,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 14:15:25,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 14:15:25,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 14:15:25,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 14:15:25,981 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 14:15:25,981 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 14:15:26,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 14:15:26,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 14:15:26,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 14:15:26,436 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 14:15:26,439 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 14:15:26,440 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label45.c [2021-01-06 14:15:26,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bdbb446e2/f7177558f52e4398866b3c496dc51ee1/FLAGe4892fb5a [2021-01-06 14:15:27,336 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 14:15:27,339 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label45.c [2021-01-06 14:15:27,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bdbb446e2/f7177558f52e4398866b3c496dc51ee1/FLAGe4892fb5a [2021-01-06 14:15:27,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bdbb446e2/f7177558f52e4398866b3c496dc51ee1 [2021-01-06 14:15:27,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 14:15:27,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 14:15:27,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 14:15:27,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 14:15:27,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 14:15:27,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 02:15:27" (1/1) ... [2021-01-06 14:15:27,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b19de50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:27, skipping insertion in model container [2021-01-06 14:15:27,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 02:15:27" (1/1) ... [2021-01-06 14:15:27,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 14:15:27,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 14:15:28,024 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_label45.c[3828,3841] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 14:15:28,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 14:15:28,419 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 14:15:28,462 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_label45.c[3828,3841] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 14:15:28,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 14:15:28,655 INFO L208 MainTranslator]: Completed translation [2021-01-06 14:15:28,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:28 WrapperNode [2021-01-06 14:15:28,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 14:15:28,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 14:15:28,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 14:15:28,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 14:15:28,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:28" (1/1) ... [2021-01-06 14:15:28,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:28" (1/1) ... [2021-01-06 14:15:28,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 14:15:28,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 14:15:28,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 14:15:28,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 14:15:28,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:28" (1/1) ... [2021-01-06 14:15:28,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:28" (1/1) ... [2021-01-06 14:15:28,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:28" (1/1) ... [2021-01-06 14:15:28,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:28" (1/1) ... [2021-01-06 14:15:28,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:28" (1/1) ... [2021-01-06 14:15:28,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:28" (1/1) ... [2021-01-06 14:15:28,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:28" (1/1) ... [2021-01-06 14:15:28,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 14:15:28,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 14:15:28,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 14:15:28,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 14:15:28,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:28" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 14:15:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 14:15:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 14:15:29,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 14:15:29,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 14:15:30,985 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 14:15:30,985 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 14:15:30,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:15:30 BoogieIcfgContainer [2021-01-06 14:15:30,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 14:15:30,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 14:15:30,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 14:15:30,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 14:15:30,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 02:15:27" (1/3) ... [2021-01-06 14:15:30,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a0b8bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 02:15:30, skipping insertion in model container [2021-01-06 14:15:30,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:15:28" (2/3) ... [2021-01-06 14:15:30,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a0b8bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 02:15:30, skipping insertion in model container [2021-01-06 14:15:30,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:15:30" (3/3) ... [2021-01-06 14:15:30,999 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label45.c [2021-01-06 14:15:31,007 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 14:15:31,013 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 14:15:31,035 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 14:15:31,067 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 14:15:31,067 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 14:15:31,067 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 14:15:31,068 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 14:15:31,068 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 14:15:31,068 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 14:15:31,069 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 14:15:31,069 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 14:15:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2021-01-06 14:15:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 14:15:31,102 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:31,103 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] [2021-01-06 14:15:31,104 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:31,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:31,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2021-01-06 14:15:31,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:31,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640263906] [2021-01-06 14:15:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:15:31,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640263906] [2021-01-06 14:15:31,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:15:31,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 14:15:31,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497929604] [2021-01-06 14:15:31,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:31,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:31,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:31,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:15:31,530 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 3 states. [2021-01-06 14:15:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:32,980 INFO L93 Difference]: Finished difference Result 685 states and 1216 transitions. [2021-01-06 14:15:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:15:32,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2021-01-06 14:15:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:33,000 INFO L225 Difference]: With dead ends: 685 [2021-01-06 14:15:33,000 INFO L226 Difference]: Without dead ends: 360 [2021-01-06 14:15:33,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:15:33,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-01-06 14:15:33,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2021-01-06 14:15:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2021-01-06 14:15:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2021-01-06 14:15:33,092 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 36 [2021-01-06 14:15:33,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:33,093 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2021-01-06 14:15:33,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:15:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2021-01-06 14:15:33,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-01-06 14:15:33,098 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:33,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:15:33,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 14:15:33,099 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:33,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:33,100 INFO L82 PathProgramCache]: Analyzing trace with hash 598559029, now seen corresponding path program 1 times [2021-01-06 14:15:33,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:33,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309568223] [2021-01-06 14:15:33,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:15:33,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309568223] [2021-01-06 14:15:33,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:15:33,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:15:33,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005421266] [2021-01-06 14:15:33,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:15:33,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:33,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:15:33,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:15:33,388 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand 4 states. [2021-01-06 14:15:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:34,859 INFO L93 Difference]: Finished difference Result 1074 states and 1446 transitions. [2021-01-06 14:15:34,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:15:34,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2021-01-06 14:15:34,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:34,868 INFO L225 Difference]: With dead ends: 1074 [2021-01-06 14:15:34,868 INFO L226 Difference]: Without dead ends: 716 [2021-01-06 14:15:34,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:15:34,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-01-06 14:15:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-01-06 14:15:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2021-01-06 14:15:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 902 transitions. [2021-01-06 14:15:34,956 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 902 transitions. Word has length 115 [2021-01-06 14:15:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:34,957 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 902 transitions. [2021-01-06 14:15:34,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:15:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 902 transitions. [2021-01-06 14:15:34,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-01-06 14:15:34,965 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:34,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:15:34,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 14:15:34,966 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:34,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:34,967 INFO L82 PathProgramCache]: Analyzing trace with hash 962256372, now seen corresponding path program 1 times [2021-01-06 14:15:34,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:34,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795262721] [2021-01-06 14:15:34,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 14:15:35,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795262721] [2021-01-06 14:15:35,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618815925] [2021-01-06 14:15:35,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:15:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:35,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:15:35,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:15:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-01-06 14:15:35,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:15:35,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2021-01-06 14:15:35,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125055815] [2021-01-06 14:15:35,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:35,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:35,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:35,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:15:35,617 INFO L87 Difference]: Start difference. First operand 716 states and 902 transitions. Second operand 3 states. [2021-01-06 14:15:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:36,632 INFO L93 Difference]: Finished difference Result 1252 states and 1612 transitions. [2021-01-06 14:15:36,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:15:36,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2021-01-06 14:15:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:36,652 INFO L225 Difference]: With dead ends: 1252 [2021-01-06 14:15:36,652 INFO L226 Difference]: Without dead ends: 1250 [2021-01-06 14:15:36,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:15:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-01-06 14:15:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 894. [2021-01-06 14:15:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2021-01-06 14:15:36,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1194 transitions. [2021-01-06 14:15:36,697 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1194 transitions. Word has length 141 [2021-01-06 14:15:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:36,698 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 1194 transitions. [2021-01-06 14:15:36,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:15:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1194 transitions. [2021-01-06 14:15:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-01-06 14:15:36,711 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:36,711 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 14:15:36,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 14:15:36,919 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:36,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1175834839, now seen corresponding path program 1 times [2021-01-06 14:15:36,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:36,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574492381] [2021-01-06 14:15:36,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 14:15:37,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574492381] [2021-01-06 14:15:37,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:15:37,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:15:37,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471474841] [2021-01-06 14:15:37,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:15:37,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:37,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:15:37,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:15:37,250 INFO L87 Difference]: Start difference. First operand 894 states and 1194 transitions. Second operand 4 states. [2021-01-06 14:15:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:38,297 INFO L93 Difference]: Finished difference Result 1993 states and 2629 transitions. [2021-01-06 14:15:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:15:38,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2021-01-06 14:15:38,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:38,304 INFO L225 Difference]: With dead ends: 1993 [2021-01-06 14:15:38,304 INFO L226 Difference]: Without dead ends: 1072 [2021-01-06 14:15:38,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:15:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2021-01-06 14:15:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2021-01-06 14:15:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2021-01-06 14:15:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2021-01-06 14:15:38,340 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 195 [2021-01-06 14:15:38,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:38,340 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2021-01-06 14:15:38,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:15:38,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2021-01-06 14:15:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-01-06 14:15:38,344 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:38,344 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:15:38,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 14:15:38,345 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:38,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:38,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1612317507, now seen corresponding path program 1 times [2021-01-06 14:15:38,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:38,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783652595] [2021-01-06 14:15:38,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 67 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:15:38,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783652595] [2021-01-06 14:15:38,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855633515] [2021-01-06 14:15:38,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:15:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:38,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:15:38,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:15:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-01-06 14:15:39,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:15:39,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:15:39,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473915235] [2021-01-06 14:15:39,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:39,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:39,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:39,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:15:39,070 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand 3 states. [2021-01-06 14:15:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:39,989 INFO L93 Difference]: Finished difference Result 2498 states and 3033 transitions. [2021-01-06 14:15:39,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:15:39,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2021-01-06 14:15:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:39,997 INFO L225 Difference]: With dead ends: 2498 [2021-01-06 14:15:39,997 INFO L226 Difference]: Without dead ends: 1428 [2021-01-06 14:15:40,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:15:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2021-01-06 14:15:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1072. [2021-01-06 14:15:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2021-01-06 14:15:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2021-01-06 14:15:40,034 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 207 [2021-01-06 14:15:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:40,035 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2021-01-06 14:15:40,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:15:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2021-01-06 14:15:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-01-06 14:15:40,038 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:40,039 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 14:15:40,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:15:40,253 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:40,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:40,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1756406788, now seen corresponding path program 1 times [2021-01-06 14:15:40,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:40,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175195639] [2021-01-06 14:15:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:15:40,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175195639] [2021-01-06 14:15:40,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894545702] [2021-01-06 14:15:40,560 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 [2021-01-06 14:15:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:40,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:15:40,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:15:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-01-06 14:15:41,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:15:41,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:15:41,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533140638] [2021-01-06 14:15:41,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:41,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:41,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:41,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:15:41,019 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand 3 states. [2021-01-06 14:15:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:41,871 INFO L93 Difference]: Finished difference Result 2676 states and 3242 transitions. [2021-01-06 14:15:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:15:41,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2021-01-06 14:15:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:41,881 INFO L225 Difference]: With dead ends: 2676 [2021-01-06 14:15:41,881 INFO L226 Difference]: Without dead ends: 1606 [2021-01-06 14:15:41,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:15:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2021-01-06 14:15:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2021-01-06 14:15:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2021-01-06 14:15:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1659 transitions. [2021-01-06 14:15:41,927 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1659 transitions. Word has length 210 [2021-01-06 14:15:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:41,928 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 1659 transitions. [2021-01-06 14:15:41,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:15:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1659 transitions. [2021-01-06 14:15:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-01-06 14:15:41,932 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:41,932 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 14:15:42,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:15:42,146 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1944755382, now seen corresponding path program 1 times [2021-01-06 14:15:42,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:42,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684518505] [2021-01-06 14:15:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 67 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:15:42,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684518505] [2021-01-06 14:15:42,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931164215] [2021-01-06 14:15:42,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:15:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:42,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:15:42,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:15:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 14:15:42,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:15:42,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2021-01-06 14:15:42,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011423471] [2021-01-06 14:15:42,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:42,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:42,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:42,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:15:42,819 INFO L87 Difference]: Start difference. First operand 1428 states and 1659 transitions. Second operand 3 states. [2021-01-06 14:15:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:43,753 INFO L93 Difference]: Finished difference Result 3388 states and 3985 transitions. [2021-01-06 14:15:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:15:43,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2021-01-06 14:15:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:43,765 INFO L225 Difference]: With dead ends: 3388 [2021-01-06 14:15:43,765 INFO L226 Difference]: Without dead ends: 1962 [2021-01-06 14:15:43,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:15:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2021-01-06 14:15:43,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2021-01-06 14:15:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2021-01-06 14:15:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2048 transitions. [2021-01-06 14:15:43,820 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2048 transitions. Word has length 217 [2021-01-06 14:15:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:43,820 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2048 transitions. [2021-01-06 14:15:43,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:15:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2048 transitions. [2021-01-06 14:15:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-01-06 14:15:43,825 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:43,825 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 14:15:44,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:15:44,039 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:44,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:44,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1583223651, now seen corresponding path program 1 times [2021-01-06 14:15:44,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:44,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529440534] [2021-01-06 14:15:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:15:44,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529440534] [2021-01-06 14:15:44,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:15:44,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:15:44,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141262164] [2021-01-06 14:15:44,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:44,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:44,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:44,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:15:44,215 INFO L87 Difference]: Start difference. First operand 1784 states and 2048 transitions. Second operand 3 states. [2021-01-06 14:15:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:45,076 INFO L93 Difference]: Finished difference Result 4278 states and 4958 transitions. [2021-01-06 14:15:45,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:15:45,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2021-01-06 14:15:45,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:45,089 INFO L225 Difference]: With dead ends: 4278 [2021-01-06 14:15:45,089 INFO L226 Difference]: Without dead ends: 2496 [2021-01-06 14:15:45,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:15:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2021-01-06 14:15:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2496. [2021-01-06 14:15:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2021-01-06 14:15:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2811 transitions. [2021-01-06 14:15:45,150 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2811 transitions. Word has length 220 [2021-01-06 14:15:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:45,151 INFO L481 AbstractCegarLoop]: Abstraction has 2496 states and 2811 transitions. [2021-01-06 14:15:45,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:15:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2811 transitions. [2021-01-06 14:15:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2021-01-06 14:15:45,159 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:45,160 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:15:45,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 14:15:45,160 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:45,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:45,161 INFO L82 PathProgramCache]: Analyzing trace with hash 918840898, now seen corresponding path program 1 times [2021-01-06 14:15:45,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:45,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596036561] [2021-01-06 14:15:45,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2021-01-06 14:15:45,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596036561] [2021-01-06 14:15:45,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:15:45,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:15:45,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281868678] [2021-01-06 14:15:45,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:15:45,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:45,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:15:45,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:15:45,669 INFO L87 Difference]: Start difference. First operand 2496 states and 2811 transitions. Second operand 4 states. [2021-01-06 14:15:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:46,629 INFO L93 Difference]: Finished difference Result 5019 states and 5660 transitions. [2021-01-06 14:15:46,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:15:46,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 406 [2021-01-06 14:15:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:46,643 INFO L225 Difference]: With dead ends: 5019 [2021-01-06 14:15:46,644 INFO L226 Difference]: Without dead ends: 2674 [2021-01-06 14:15:46,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:15:46,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2021-01-06 14:15:46,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2496. [2021-01-06 14:15:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2021-01-06 14:15:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2707 transitions. [2021-01-06 14:15:46,696 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2707 transitions. Word has length 406 [2021-01-06 14:15:46,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:46,697 INFO L481 AbstractCegarLoop]: Abstraction has 2496 states and 2707 transitions. [2021-01-06 14:15:46,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:15:46,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2707 transitions. [2021-01-06 14:15:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2021-01-06 14:15:46,706 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:46,706 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1] [2021-01-06 14:15:46,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 14:15:46,707 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:46,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:46,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2097605693, now seen corresponding path program 1 times [2021-01-06 14:15:46,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:46,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887389868] [2021-01-06 14:15:46,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2021-01-06 14:15:47,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887389868] [2021-01-06 14:15:47,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:15:47,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:15:47,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565444114] [2021-01-06 14:15:47,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:47,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:47,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:47,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:15:47,216 INFO L87 Difference]: Start difference. First operand 2496 states and 2707 transitions. Second operand 3 states. [2021-01-06 14:15:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:47,946 INFO L93 Difference]: Finished difference Result 5168 states and 5603 transitions. [2021-01-06 14:15:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:15:47,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 432 [2021-01-06 14:15:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:47,963 INFO L225 Difference]: With dead ends: 5168 [2021-01-06 14:15:47,963 INFO L226 Difference]: Without dead ends: 2852 [2021-01-06 14:15:47,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:15:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2021-01-06 14:15:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2021-01-06 14:15:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2021-01-06 14:15:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2874 transitions. [2021-01-06 14:15:48,023 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2874 transitions. Word has length 432 [2021-01-06 14:15:48,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:48,024 INFO L481 AbstractCegarLoop]: Abstraction has 2674 states and 2874 transitions. [2021-01-06 14:15:48,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:15:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2874 transitions. [2021-01-06 14:15:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2021-01-06 14:15:48,033 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:48,034 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:15:48,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 14:15:48,034 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:48,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:48,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1273102846, now seen corresponding path program 1 times [2021-01-06 14:15:48,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:48,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976691961] [2021-01-06 14:15:48,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2021-01-06 14:15:48,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976691961] [2021-01-06 14:15:48,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:15:48,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:15:48,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187084803] [2021-01-06 14:15:48,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:48,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:48,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:48,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:15:48,422 INFO L87 Difference]: Start difference. First operand 2674 states and 2874 transitions. Second operand 3 states. [2021-01-06 14:15:49,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:49,324 INFO L93 Difference]: Finished difference Result 6058 states and 6581 transitions. [2021-01-06 14:15:49,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:15:49,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 439 [2021-01-06 14:15:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:49,344 INFO L225 Difference]: With dead ends: 6058 [2021-01-06 14:15:49,344 INFO L226 Difference]: Without dead ends: 3564 [2021-01-06 14:15:49,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:15:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2021-01-06 14:15:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2021-01-06 14:15:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2021-01-06 14:15:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3827 transitions. [2021-01-06 14:15:49,425 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3827 transitions. Word has length 439 [2021-01-06 14:15:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:49,426 INFO L481 AbstractCegarLoop]: Abstraction has 3564 states and 3827 transitions. [2021-01-06 14:15:49,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:15:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3827 transitions. [2021-01-06 14:15:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2021-01-06 14:15:49,430 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:49,430 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:15:49,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 14:15:49,431 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:49,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:49,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1472140603, now seen corresponding path program 1 times [2021-01-06 14:15:49,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:49,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932553689] [2021-01-06 14:15:49,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 385 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-01-06 14:15:50,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932553689] [2021-01-06 14:15:50,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786855743] [2021-01-06 14:15:50,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:15:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:50,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:15:50,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:15:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2021-01-06 14:15:50,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:15:50,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 14:15:50,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972716964] [2021-01-06 14:15:50,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:50,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:50,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:50,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:15:50,779 INFO L87 Difference]: Start difference. First operand 3564 states and 3827 transitions. Second operand 3 states. [2021-01-06 14:15:51,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:51,541 INFO L93 Difference]: Finished difference Result 7482 states and 8048 transitions. [2021-01-06 14:15:51,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:15:51,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 484 [2021-01-06 14:15:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:51,558 INFO L225 Difference]: With dead ends: 7482 [2021-01-06 14:15:51,558 INFO L226 Difference]: Without dead ends: 3386 [2021-01-06 14:15:51,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:15:51,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2021-01-06 14:15:51,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 2852. [2021-01-06 14:15:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 14:15:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3052 transitions. [2021-01-06 14:15:51,625 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3052 transitions. Word has length 484 [2021-01-06 14:15:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:51,626 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 3052 transitions. [2021-01-06 14:15:51,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:15:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3052 transitions. [2021-01-06 14:15:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2021-01-06 14:15:51,632 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:51,633 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:15:51,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 14:15:51,847 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:51,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:51,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1725117953, now seen corresponding path program 1 times [2021-01-06 14:15:51,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:51,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318562709] [2021-01-06 14:15:51,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 794 proven. 195 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-01-06 14:15:52,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318562709] [2021-01-06 14:15:52,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864039912] [2021-01-06 14:15:52,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:15:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:52,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:15:52,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:15:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2021-01-06 14:15:53,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:15:53,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 14:15:53,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083221751] [2021-01-06 14:15:53,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:53,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:53,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:53,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:15:53,604 INFO L87 Difference]: Start difference. First operand 2852 states and 3052 transitions. Second operand 3 states. [2021-01-06 14:15:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:54,417 INFO L93 Difference]: Finished difference Result 6058 states and 6533 transitions. [2021-01-06 14:15:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:15:54,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 595 [2021-01-06 14:15:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:54,434 INFO L225 Difference]: With dead ends: 6058 [2021-01-06 14:15:54,435 INFO L226 Difference]: Without dead ends: 3386 [2021-01-06 14:15:54,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:15:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2021-01-06 14:15:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3030. [2021-01-06 14:15:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2021-01-06 14:15:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3238 transitions. [2021-01-06 14:15:54,506 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3238 transitions. Word has length 595 [2021-01-06 14:15:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:54,507 INFO L481 AbstractCegarLoop]: Abstraction has 3030 states and 3238 transitions. [2021-01-06 14:15:54,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:15:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3238 transitions. [2021-01-06 14:15:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2021-01-06 14:15:54,518 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:54,518 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:15:54,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:15:54,734 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:54,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:54,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1647380664, now seen corresponding path program 1 times [2021-01-06 14:15:54,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:54,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897211047] [2021-01-06 14:15:54,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 870 proven. 195 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-01-06 14:15:55,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897211047] [2021-01-06 14:15:55,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379622663] [2021-01-06 14:15:55,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:15:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:55,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:15:55,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:15:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2021-01-06 14:15:56,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:15:56,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 14:15:56,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554949845] [2021-01-06 14:15:56,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:56,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:56,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:56,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:15:56,560 INFO L87 Difference]: Start difference. First operand 3030 states and 3238 transitions. Second operand 3 states. [2021-01-06 14:15:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:57,318 INFO L93 Difference]: Finished difference Result 6058 states and 6478 transitions. [2021-01-06 14:15:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:15:57,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 614 [2021-01-06 14:15:57,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:57,333 INFO L225 Difference]: With dead ends: 6058 [2021-01-06 14:15:57,334 INFO L226 Difference]: Without dead ends: 3208 [2021-01-06 14:15:57,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:15:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2021-01-06 14:15:57,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2852. [2021-01-06 14:15:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 14:15:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3044 transitions. [2021-01-06 14:15:57,391 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3044 transitions. Word has length 614 [2021-01-06 14:15:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:57,392 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 3044 transitions. [2021-01-06 14:15:57,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:15:57,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3044 transitions. [2021-01-06 14:15:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2021-01-06 14:15:57,399 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:57,400 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:15:57,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 14:15:57,615 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:57,616 INFO L82 PathProgramCache]: Analyzing trace with hash 696380581, now seen corresponding path program 1 times [2021-01-06 14:15:57,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:57,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736395242] [2021-01-06 14:15:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 900 proven. 195 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-01-06 14:15:58,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736395242] [2021-01-06 14:15:58,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502303890] [2021-01-06 14:15:58,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:15:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:58,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:15:58,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:15:59,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 568 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-01-06 14:15:59,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:15:59,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2021-01-06 14:15:59,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516204078] [2021-01-06 14:15:59,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:59,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:59,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:59,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:15:59,932 INFO L87 Difference]: Start difference. First operand 2852 states and 3044 transitions. Second operand 3 states. [2021-01-06 14:16:00,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:00,662 INFO L93 Difference]: Finished difference Result 5702 states and 6090 transitions. [2021-01-06 14:16:00,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:00,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 628 [2021-01-06 14:16:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:00,671 INFO L225 Difference]: With dead ends: 5702 [2021-01-06 14:16:00,671 INFO L226 Difference]: Without dead ends: 2852 [2021-01-06 14:16:00,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:00,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2021-01-06 14:16:00,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2021-01-06 14:16:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 14:16:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 2989 transitions. [2021-01-06 14:16:00,724 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 2989 transitions. Word has length 628 [2021-01-06 14:16:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:00,725 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 2989 transitions. [2021-01-06 14:16:00,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 2989 transitions. [2021-01-06 14:16:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2021-01-06 14:16:00,732 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:00,732 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:00,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 14:16:00,948 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:00,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:00,950 INFO L82 PathProgramCache]: Analyzing trace with hash -963993425, now seen corresponding path program 1 times [2021-01-06 14:16:00,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:00,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709932087] [2021-01-06 14:16:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2021-01-06 14:16:01,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709932087] [2021-01-06 14:16:01,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:01,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:01,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584122021] [2021-01-06 14:16:01,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:01,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:01,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:01,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:01,560 INFO L87 Difference]: Start difference. First operand 2852 states and 2989 transitions. Second operand 3 states. [2021-01-06 14:16:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:02,238 INFO L93 Difference]: Finished difference Result 6414 states and 6743 transitions. [2021-01-06 14:16:02,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:02,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 650 [2021-01-06 14:16:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:02,247 INFO L225 Difference]: With dead ends: 6414 [2021-01-06 14:16:02,247 INFO L226 Difference]: Without dead ends: 3742 [2021-01-06 14:16:02,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2021-01-06 14:16:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2021-01-06 14:16:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:16:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3904 transitions. [2021-01-06 14:16:02,309 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3904 transitions. Word has length 650 [2021-01-06 14:16:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:02,310 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3904 transitions. [2021-01-06 14:16:02,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3904 transitions. [2021-01-06 14:16:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2021-01-06 14:16:02,320 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:02,320 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:02,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 14:16:02,321 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:02,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:02,322 INFO L82 PathProgramCache]: Analyzing trace with hash 380264438, now seen corresponding path program 1 times [2021-01-06 14:16:02,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:02,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550206222] [2021-01-06 14:16:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 1368 proven. 155 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2021-01-06 14:16:03,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550206222] [2021-01-06 14:16:03,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028589059] [2021-01-06 14:16:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:03,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:16:03,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 1368 proven. 155 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2021-01-06 14:16:04,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 14:16:04,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 14:16:04,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354402798] [2021-01-06 14:16:04,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:04,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:04,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:04,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:04,457 INFO L87 Difference]: Start difference. First operand 3742 states and 3904 transitions. Second operand 4 states. [2021-01-06 14:16:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:05,445 INFO L93 Difference]: Finished difference Result 7838 states and 8201 transitions. [2021-01-06 14:16:05,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:05,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 805 [2021-01-06 14:16:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:05,457 INFO L225 Difference]: With dead ends: 7838 [2021-01-06 14:16:05,457 INFO L226 Difference]: Without dead ends: 4276 [2021-01-06 14:16:05,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 806 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2021-01-06 14:16:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2021-01-06 14:16:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2021-01-06 14:16:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4465 transitions. [2021-01-06 14:16:05,555 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4465 transitions. Word has length 805 [2021-01-06 14:16:05,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:05,557 INFO L481 AbstractCegarLoop]: Abstraction has 4276 states and 4465 transitions. [2021-01-06 14:16:05,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:05,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4465 transitions. [2021-01-06 14:16:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2021-01-06 14:16:05,569 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:05,570 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:05,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 14:16:05,784 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:05,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:05,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1954280938, now seen corresponding path program 1 times [2021-01-06 14:16:05,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:05,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038117506] [2021-01-06 14:16:05,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2336 backedges. 1516 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-01-06 14:16:06,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038117506] [2021-01-06 14:16:06,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:06,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:06,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210460396] [2021-01-06 14:16:06,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:06,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:06,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:06,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:06,583 INFO L87 Difference]: Start difference. First operand 4276 states and 4465 transitions. Second operand 3 states. [2021-01-06 14:16:07,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:07,279 INFO L93 Difference]: Finished difference Result 8906 states and 9325 transitions. [2021-01-06 14:16:07,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:07,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 877 [2021-01-06 14:16:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:07,290 INFO L225 Difference]: With dead ends: 8906 [2021-01-06 14:16:07,290 INFO L226 Difference]: Without dead ends: 4810 [2021-01-06 14:16:07,296 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-01-06 14:16:07,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810. [2021-01-06 14:16:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2021-01-06 14:16:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5003 transitions. [2021-01-06 14:16:07,389 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5003 transitions. Word has length 877 [2021-01-06 14:16:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:07,390 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 5003 transitions. [2021-01-06 14:16:07,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5003 transitions. [2021-01-06 14:16:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2021-01-06 14:16:07,404 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:07,405 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:07,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 14:16:07,405 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:07,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:07,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2059482391, now seen corresponding path program 1 times [2021-01-06 14:16:07,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:07,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70235861] [2021-01-06 14:16:07,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 1586 proven. 93 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2021-01-06 14:16:08,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70235861] [2021-01-06 14:16:08,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920174461] [2021-01-06 14:16:08,760 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:09,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:16:09,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 1679 proven. 0 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2021-01-06 14:16:10,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:10,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:16:10,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257448933] [2021-01-06 14:16:10,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:10,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:10,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:10,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:10,168 INFO L87 Difference]: Start difference. First operand 4810 states and 5003 transitions. Second operand 3 states. [2021-01-06 14:16:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:10,873 INFO L93 Difference]: Finished difference Result 9440 states and 9825 transitions. [2021-01-06 14:16:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:10,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 895 [2021-01-06 14:16:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:10,883 INFO L225 Difference]: With dead ends: 9440 [2021-01-06 14:16:10,883 INFO L226 Difference]: Without dead ends: 4810 [2021-01-06 14:16:10,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 894 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-01-06 14:16:10,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2021-01-06 14:16:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:16:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4821 transitions. [2021-01-06 14:16:10,964 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4821 transitions. Word has length 895 [2021-01-06 14:16:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:10,965 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4821 transitions. [2021-01-06 14:16:10,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4821 transitions. [2021-01-06 14:16:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 973 [2021-01-06 14:16:10,977 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:10,978 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:11,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:11,192 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:11,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:11,194 INFO L82 PathProgramCache]: Analyzing trace with hash 795357471, now seen corresponding path program 1 times [2021-01-06 14:16:11,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:11,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115882155] [2021-01-06 14:16:11,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2921 backedges. 973 proven. 0 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2021-01-06 14:16:12,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115882155] [2021-01-06 14:16:12,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:12,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:12,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125298316] [2021-01-06 14:16:12,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:12,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:12,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:12,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:12,508 INFO L87 Difference]: Start difference. First operand 4632 states and 4821 transitions. Second operand 3 states. [2021-01-06 14:16:13,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:13,206 INFO L93 Difference]: Finished difference Result 8906 states and 9280 transitions. [2021-01-06 14:16:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:13,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 972 [2021-01-06 14:16:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:13,217 INFO L225 Difference]: With dead ends: 8906 [2021-01-06 14:16:13,217 INFO L226 Difference]: Without dead ends: 4454 [2021-01-06 14:16:13,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:13,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2021-01-06 14:16:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2021-01-06 14:16:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2021-01-06 14:16:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4609 transitions. [2021-01-06 14:16:13,292 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4609 transitions. Word has length 972 [2021-01-06 14:16:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:13,293 INFO L481 AbstractCegarLoop]: Abstraction has 4454 states and 4609 transitions. [2021-01-06 14:16:13,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4609 transitions. [2021-01-06 14:16:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2021-01-06 14:16:13,308 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:13,309 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:13,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 14:16:13,309 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1401544166, now seen corresponding path program 1 times [2021-01-06 14:16:13,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:13,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607982870] [2021-01-06 14:16:13,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 1082 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2021-01-06 14:16:14,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607982870] [2021-01-06 14:16:14,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:14,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:14,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293574555] [2021-01-06 14:16:14,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:14,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:14,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:14,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:14,473 INFO L87 Difference]: Start difference. First operand 4454 states and 4609 transitions. Second operand 3 states. [2021-01-06 14:16:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:15,216 INFO L93 Difference]: Finished difference Result 8906 states and 9223 transitions. [2021-01-06 14:16:15,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:15,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1047 [2021-01-06 14:16:15,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:15,227 INFO L225 Difference]: With dead ends: 8906 [2021-01-06 14:16:15,227 INFO L226 Difference]: Without dead ends: 4632 [2021-01-06 14:16:15,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2021-01-06 14:16:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2021-01-06 14:16:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:16:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4767 transitions. [2021-01-06 14:16:15,300 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4767 transitions. Word has length 1047 [2021-01-06 14:16:15,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:15,301 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4767 transitions. [2021-01-06 14:16:15,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4767 transitions. [2021-01-06 14:16:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2021-01-06 14:16:15,319 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:15,320 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:15,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 14:16:15,320 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:15,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:15,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1689291374, now seen corresponding path program 1 times [2021-01-06 14:16:15,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:15,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966090783] [2021-01-06 14:16:15,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3788 backedges. 2738 proven. 72 refuted. 0 times theorem prover too weak. 978 trivial. 0 not checked. [2021-01-06 14:16:16,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966090783] [2021-01-06 14:16:16,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737634061] [2021-01-06 14:16:16,528 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:16,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 14:16:16,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3788 backedges. 2697 proven. 666 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2021-01-06 14:16:18,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 14:16:18,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2021-01-06 14:16:18,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014921733] [2021-01-06 14:16:18,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 14:16:18,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:18,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 14:16:18,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:18,544 INFO L87 Difference]: Start difference. First operand 4632 states and 4767 transitions. Second operand 6 states. [2021-01-06 14:16:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:20,830 INFO L93 Difference]: Finished difference Result 9796 states and 10087 transitions. [2021-01-06 14:16:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 14:16:20,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1095 [2021-01-06 14:16:20,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:20,844 INFO L225 Difference]: With dead ends: 9796 [2021-01-06 14:16:20,844 INFO L226 Difference]: Without dead ends: 5344 [2021-01-06 14:16:20,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 1096 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:16:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2021-01-06 14:16:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5166. [2021-01-06 14:16:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2021-01-06 14:16:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5300 transitions. [2021-01-06 14:16:20,928 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5300 transitions. Word has length 1095 [2021-01-06 14:16:20,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:20,929 INFO L481 AbstractCegarLoop]: Abstraction has 5166 states and 5300 transitions. [2021-01-06 14:16:20,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 14:16:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5300 transitions. [2021-01-06 14:16:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1633 [2021-01-06 14:16:20,958 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:20,959 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:21,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-01-06 14:16:21,173 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:21,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:21,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2046809236, now seen corresponding path program 1 times [2021-01-06 14:16:21,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:21,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70936016] [2021-01-06 14:16:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8487 backedges. 4284 proven. 588 refuted. 0 times theorem prover too weak. 3615 trivial. 0 not checked. [2021-01-06 14:16:25,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70936016] [2021-01-06 14:16:25,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908335152] [2021-01-06 14:16:25,071 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:25,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 1997 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 14:16:25,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:26,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 14:16:27,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 14:16:27,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 14:16:27,153 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:27,284 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8487 backedges. 3476 proven. 435 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2021-01-06 14:16:29,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 14:16:29,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2021-01-06 14:16:29,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241227169] [2021-01-06 14:16:29,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 14:16:29,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:29,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 14:16:29,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-01-06 14:16:29,736 INFO L87 Difference]: Start difference. First operand 5166 states and 5300 transitions. Second operand 11 states. [2021-01-06 14:16:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:38,856 INFO L93 Difference]: Finished difference Result 12127 states and 12449 transitions. [2021-01-06 14:16:38,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 14:16:38,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1632 [2021-01-06 14:16:38,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:38,871 INFO L225 Difference]: With dead ends: 12127 [2021-01-06 14:16:38,871 INFO L226 Difference]: Without dead ends: 7124 [2021-01-06 14:16:38,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1655 GetRequests, 1637 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-01-06 14:16:38,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7124 states. [2021-01-06 14:16:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7124 to 6056. [2021-01-06 14:16:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2021-01-06 14:16:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6207 transitions. [2021-01-06 14:16:38,972 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6207 transitions. Word has length 1632 [2021-01-06 14:16:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:38,973 INFO L481 AbstractCegarLoop]: Abstraction has 6056 states and 6207 transitions. [2021-01-06 14:16:38,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 14:16:38,974 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6207 transitions. [2021-01-06 14:16:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1806 [2021-01-06 14:16:39,007 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:39,008 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:39,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:39,222 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:39,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:39,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1515396758, now seen corresponding path program 1 times [2021-01-06 14:16:39,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:39,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004579740] [2021-01-06 14:16:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10095 backedges. 3290 proven. 1045 refuted. 0 times theorem prover too weak. 5760 trivial. 0 not checked. [2021-01-06 14:16:42,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004579740] [2021-01-06 14:16:42,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044451353] [2021-01-06 14:16:42,380 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:42,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 2197 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:16:42,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10095 backedges. 4335 proven. 0 refuted. 0 times theorem prover too weak. 5760 trivial. 0 not checked. [2021-01-06 14:16:45,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:45,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:16:45,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796248535] [2021-01-06 14:16:45,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:45,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:45,799 INFO L87 Difference]: Start difference. First operand 6056 states and 6207 transitions. Second operand 3 states. [2021-01-06 14:16:46,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:46,545 INFO L93 Difference]: Finished difference Result 12822 states and 13132 transitions. [2021-01-06 14:16:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:46,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1805 [2021-01-06 14:16:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:46,558 INFO L225 Difference]: With dead ends: 12822 [2021-01-06 14:16:46,558 INFO L226 Difference]: Without dead ends: 4810 [2021-01-06 14:16:46,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1808 GetRequests, 1804 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-01-06 14:16:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4276. [2021-01-06 14:16:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2021-01-06 14:16:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4361 transitions. [2021-01-06 14:16:46,623 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4361 transitions. Word has length 1805 [2021-01-06 14:16:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:46,624 INFO L481 AbstractCegarLoop]: Abstraction has 4276 states and 4361 transitions. [2021-01-06 14:16:46,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4361 transitions. [2021-01-06 14:16:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1877 [2021-01-06 14:16:46,659 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:46,660 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:46,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-01-06 14:16:46,874 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:46,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:46,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1007661945, now seen corresponding path program 1 times [2021-01-06 14:16:46,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:46,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417920884] [2021-01-06 14:16:46,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 11516 backedges. 4585 proven. 121 refuted. 0 times theorem prover too weak. 6810 trivial. 0 not checked. [2021-01-06 14:16:49,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417920884] [2021-01-06 14:16:49,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815919462] [2021-01-06 14:16:49,476 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:50,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 2287 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 14:16:50,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 11516 backedges. 6906 proven. 0 refuted. 0 times theorem prover too weak. 4610 trivial. 0 not checked. [2021-01-06 14:16:53,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:53,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2021-01-06 14:16:53,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81914323] [2021-01-06 14:16:53,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 14:16:53,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:53,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 14:16:53,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:53,489 INFO L87 Difference]: Start difference. First operand 4276 states and 4361 transitions. Second operand 6 states. [2021-01-06 14:16:55,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:55,703 INFO L93 Difference]: Finished difference Result 9796 states and 10023 transitions. [2021-01-06 14:16:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 14:16:55,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1876 [2021-01-06 14:16:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:55,710 INFO L225 Difference]: With dead ends: 9796 [2021-01-06 14:16:55,711 INFO L226 Difference]: Without dead ends: 5166 [2021-01-06 14:16:55,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1879 GetRequests, 1874 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2021-01-06 14:16:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4632. [2021-01-06 14:16:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:16:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4700 transitions. [2021-01-06 14:16:55,756 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4700 transitions. Word has length 1876 [2021-01-06 14:16:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:55,757 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4700 transitions. [2021-01-06 14:16:55,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 14:16:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4700 transitions. [2021-01-06 14:16:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1930 [2021-01-06 14:16:55,787 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:55,788 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:56,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:56,003 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:56,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1011336580, now seen corresponding path program 1 times [2021-01-06 14:16:56,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:56,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714173358] [2021-01-06 14:16:56,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11684 backedges. 2009 proven. 0 refuted. 0 times theorem prover too weak. 9675 trivial. 0 not checked. [2021-01-06 14:16:58,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714173358] [2021-01-06 14:16:58,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:58,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:58,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350498247] [2021-01-06 14:16:58,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:58,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:58,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:58,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:58,391 INFO L87 Difference]: Start difference. First operand 4632 states and 4700 transitions. Second operand 3 states. [2021-01-06 14:16:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:59,098 INFO L93 Difference]: Finished difference Result 8906 states and 9040 transitions. [2021-01-06 14:16:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:59,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1929 [2021-01-06 14:16:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:59,103 INFO L225 Difference]: With dead ends: 8906 [2021-01-06 14:16:59,103 INFO L226 Difference]: Without dead ends: 4632 [2021-01-06 14:16:59,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2021-01-06 14:16:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2021-01-06 14:16:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2021-01-06 14:16:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4514 transitions. [2021-01-06 14:16:59,147 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4514 transitions. Word has length 1929 [2021-01-06 14:16:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:59,149 INFO L481 AbstractCegarLoop]: Abstraction has 4454 states and 4514 transitions. [2021-01-06 14:16:59,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4514 transitions. [2021-01-06 14:16:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2127 [2021-01-06 14:16:59,182 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:59,183 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 11, 11, 11, 10, 9, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:59,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 14:16:59,184 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:59,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1720440161, now seen corresponding path program 1 times [2021-01-06 14:16:59,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:59,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824610917] [2021-01-06 14:16:59,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 14616 backedges. 9436 proven. 0 refuted. 0 times theorem prover too weak. 5180 trivial. 0 not checked. [2021-01-06 14:17:02,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824610917] [2021-01-06 14:17:02,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:02,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:17:02,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408125446] [2021-01-06 14:17:02,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:02,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:02,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:02,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:02,563 INFO L87 Difference]: Start difference. First operand 4454 states and 4514 transitions. Second operand 3 states. [2021-01-06 14:17:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:03,222 INFO L93 Difference]: Finished difference Result 8194 states and 8300 transitions. [2021-01-06 14:17:03,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:03,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2126 [2021-01-06 14:17:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:03,226 INFO L225 Difference]: With dead ends: 8194 [2021-01-06 14:17:03,227 INFO L226 Difference]: Without dead ends: 4098 [2021-01-06 14:17:03,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:03,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2021-01-06 14:17:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3742. [2021-01-06 14:17:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:17:03,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3777 transitions. [2021-01-06 14:17:03,255 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3777 transitions. Word has length 2126 [2021-01-06 14:17:03,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:03,256 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3777 transitions. [2021-01-06 14:17:03,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3777 transitions. [2021-01-06 14:17:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2347 [2021-01-06 14:17:03,285 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:03,286 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 14, 14, 14, 13, 13, 13, 13, 12, 11, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:03,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 14:17:03,287 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:03,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:03,287 INFO L82 PathProgramCache]: Analyzing trace with hash -974203586, now seen corresponding path program 1 times [2021-01-06 14:17:03,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:03,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800274634] [2021-01-06 14:17:03,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 17373 backedges. 4222 proven. 0 refuted. 0 times theorem prover too weak. 13151 trivial. 0 not checked. [2021-01-06 14:17:06,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800274634] [2021-01-06 14:17:06,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:06,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:17:06,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698456526] [2021-01-06 14:17:06,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:06,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:06,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:06,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:06,530 INFO L87 Difference]: Start difference. First operand 3742 states and 3777 transitions. Second operand 3 states. [2021-01-06 14:17:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:07,219 INFO L93 Difference]: Finished difference Result 4810 states and 4862 transitions. [2021-01-06 14:17:07,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:07,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2346 [2021-01-06 14:17:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:07,222 INFO L225 Difference]: With dead ends: 4810 [2021-01-06 14:17:07,222 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 14:17:07,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 14:17:07,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 14:17:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 14:17:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 14:17:07,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2346 [2021-01-06 14:17:07,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:07,226 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 14:17:07,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 14:17:07,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 14:17:07,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 14:17:07,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 14:17:07,463 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 165 [2021-01-06 14:17:07,616 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 165 [2021-01-06 14:17:08,857 WARN L197 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 158 DAG size of output: 81 [2021-01-06 14:17:10,162 WARN L197 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 158 DAG size of output: 81 [2021-01-06 14:17:10,168 INFO L189 CegarLoopUtils]: For program point L762(lines 762 880) no Hoare annotation was computed. [2021-01-06 14:17:10,168 INFO L189 CegarLoopUtils]: For program point L895(line 895) no Hoare annotation was computed. [2021-01-06 14:17:10,168 INFO L189 CegarLoopUtils]: For program point L829(lines 829 880) no Hoare annotation was computed. [2021-01-06 14:17:10,168 INFO L189 CegarLoopUtils]: For program point L631(lines 631 880) no Hoare annotation was computed. [2021-01-06 14:17:10,168 INFO L189 CegarLoopUtils]: For program point L565(lines 565 880) no Hoare annotation was computed. [2021-01-06 14:17:10,168 INFO L189 CegarLoopUtils]: For program point L169-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,169 INFO L189 CegarLoopUtils]: For program point L103-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,169 INFO L189 CegarLoopUtils]: For program point L37-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,169 INFO L189 CegarLoopUtils]: For program point L698(lines 698 880) no Hoare annotation was computed. [2021-01-06 14:17:10,169 INFO L189 CegarLoopUtils]: For program point L500(lines 500 880) no Hoare annotation was computed. [2021-01-06 14:17:10,169 INFO L189 CegarLoopUtils]: For program point L170(line 170) no Hoare annotation was computed. [2021-01-06 14:17:10,169 INFO L189 CegarLoopUtils]: For program point L104(line 104) no Hoare annotation was computed. [2021-01-06 14:17:10,169 INFO L189 CegarLoopUtils]: For program point L38(line 38) no Hoare annotation was computed. [2021-01-06 14:17:10,169 INFO L189 CegarLoopUtils]: For program point L369(lines 369 880) no Hoare annotation was computed. [2021-01-06 14:17:10,170 INFO L189 CegarLoopUtils]: For program point L303(lines 303 880) no Hoare annotation was computed. [2021-01-06 14:17:10,170 INFO L189 CegarLoopUtils]: For program point L436(lines 436 880) no Hoare annotation was computed. [2021-01-06 14:17:10,170 INFO L189 CegarLoopUtils]: For program point L172-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,170 INFO L189 CegarLoopUtils]: For program point L106-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,170 INFO L189 CegarLoopUtils]: For program point L40-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,170 INFO L189 CegarLoopUtils]: For program point L239(lines 239 880) no Hoare annotation was computed. [2021-01-06 14:17:10,170 INFO L189 CegarLoopUtils]: For program point L173(line 173) no Hoare annotation was computed. [2021-01-06 14:17:10,170 INFO L189 CegarLoopUtils]: For program point L107(line 107) no Hoare annotation was computed. [2021-01-06 14:17:10,170 INFO L189 CegarLoopUtils]: For program point L41(line 41) no Hoare annotation was computed. [2021-01-06 14:17:10,170 INFO L189 CegarLoopUtils]: For program point L768(lines 768 880) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L636(lines 636 880) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L835(lines 835 880) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L571(lines 571 880) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L505(lines 505 880) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L175-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L109-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L43-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L704(lines 704 880) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L176(line 176) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L110(line 110) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L44(line 44) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L309(lines 309 880) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L442(lines 442 880) no Hoare annotation was computed. [2021-01-06 14:17:10,171 INFO L189 CegarLoopUtils]: For program point L376(lines 376 880) no Hoare annotation was computed. [2021-01-06 14:17:10,172 INFO L189 CegarLoopUtils]: For program point L178-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,172 INFO L189 CegarLoopUtils]: For program point L112-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,172 INFO L189 CegarLoopUtils]: For program point L46-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,172 INFO L189 CegarLoopUtils]: For program point L245(lines 245 880) no Hoare annotation was computed. [2021-01-06 14:17:10,172 INFO L189 CegarLoopUtils]: For program point L179(line 179) no Hoare annotation was computed. [2021-01-06 14:17:10,172 INFO L189 CegarLoopUtils]: For program point L113(line 113) no Hoare annotation was computed. [2021-01-06 14:17:10,172 INFO L189 CegarLoopUtils]: For program point L47(line 47) no Hoare annotation was computed. [2021-01-06 14:17:10,172 INFO L189 CegarLoopUtils]: For program point L774(lines 774 880) no Hoare annotation was computed. [2021-01-06 14:17:10,172 INFO L189 CegarLoopUtils]: For program point L642(lines 642 880) no Hoare annotation was computed. [2021-01-06 14:17:10,172 INFO L189 CegarLoopUtils]: For program point L510(lines 510 880) no Hoare annotation was computed. [2021-01-06 14:17:10,172 INFO L189 CegarLoopUtils]: For program point L841(lines 841 880) no Hoare annotation was computed. [2021-01-06 14:17:10,173 INFO L189 CegarLoopUtils]: For program point L181-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,173 INFO L189 CegarLoopUtils]: For program point L115-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,173 INFO L189 CegarLoopUtils]: For program point L49-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,173 INFO L189 CegarLoopUtils]: For program point L710(lines 710 880) no Hoare annotation was computed. [2021-01-06 14:17:10,173 INFO L189 CegarLoopUtils]: For program point L578(lines 578 880) no Hoare annotation was computed. [2021-01-06 14:17:10,173 INFO L189 CegarLoopUtils]: For program point L182(line 182) no Hoare annotation was computed. [2021-01-06 14:17:10,173 INFO L189 CegarLoopUtils]: For program point L116(line 116) no Hoare annotation was computed. [2021-01-06 14:17:10,173 INFO L189 CegarLoopUtils]: For program point L50(line 50) no Hoare annotation was computed. [2021-01-06 14:17:10,173 INFO L189 CegarLoopUtils]: For program point L315(lines 315 880) no Hoare annotation was computed. [2021-01-06 14:17:10,174 INFO L189 CegarLoopUtils]: For program point L448(lines 448 880) no Hoare annotation was computed. [2021-01-06 14:17:10,174 INFO L189 CegarLoopUtils]: For program point L382(lines 382 880) no Hoare annotation was computed. [2021-01-06 14:17:10,174 INFO L189 CegarLoopUtils]: For program point L184-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,174 INFO L189 CegarLoopUtils]: For program point L118-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,174 INFO L189 CegarLoopUtils]: For program point L52-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,174 INFO L189 CegarLoopUtils]: For program point L251(lines 251 880) no Hoare annotation was computed. [2021-01-06 14:17:10,174 INFO L189 CegarLoopUtils]: For program point L185(line 185) no Hoare annotation was computed. [2021-01-06 14:17:10,174 INFO L189 CegarLoopUtils]: For program point L119(line 119) no Hoare annotation was computed. [2021-01-06 14:17:10,174 INFO L189 CegarLoopUtils]: For program point L53(line 53) no Hoare annotation was computed. [2021-01-06 14:17:10,174 INFO L189 CegarLoopUtils]: For program point L648(lines 648 880) no Hoare annotation was computed. [2021-01-06 14:17:10,175 INFO L189 CegarLoopUtils]: For program point L516(lines 516 880) no Hoare annotation was computed. [2021-01-06 14:17:10,175 INFO L189 CegarLoopUtils]: For program point L847(lines 847 880) no Hoare annotation was computed. [2021-01-06 14:17:10,175 INFO L189 CegarLoopUtils]: For program point L781(lines 781 880) no Hoare annotation was computed. [2021-01-06 14:17:10,175 INFO L189 CegarLoopUtils]: For program point L583(lines 583 880) no Hoare annotation was computed. [2021-01-06 14:17:10,175 INFO L189 CegarLoopUtils]: For program point L187-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,175 INFO L189 CegarLoopUtils]: For program point L121-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,175 INFO L189 CegarLoopUtils]: For program point L55-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,175 INFO L189 CegarLoopUtils]: For program point L716(lines 716 880) no Hoare annotation was computed. [2021-01-06 14:17:10,175 INFO L189 CegarLoopUtils]: For program point L188(line 188) no Hoare annotation was computed. [2021-01-06 14:17:10,175 INFO L189 CegarLoopUtils]: For program point L122(line 122) no Hoare annotation was computed. [2021-01-06 14:17:10,176 INFO L189 CegarLoopUtils]: For program point L56(line 56) no Hoare annotation was computed. [2021-01-06 14:17:10,176 INFO L189 CegarLoopUtils]: For program point L321(lines 321 880) no Hoare annotation was computed. [2021-01-06 14:17:10,176 INFO L189 CegarLoopUtils]: For program point L454(lines 454 880) no Hoare annotation was computed. [2021-01-06 14:17:10,176 INFO L189 CegarLoopUtils]: For program point L388(lines 388 880) no Hoare annotation was computed. [2021-01-06 14:17:10,176 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 14:17:10,176 INFO L189 CegarLoopUtils]: For program point L190-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,176 INFO L189 CegarLoopUtils]: For program point L124-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,176 INFO L189 CegarLoopUtils]: For program point L58-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,176 INFO L189 CegarLoopUtils]: For program point L257(lines 257 880) no Hoare annotation was computed. [2021-01-06 14:17:10,176 INFO L189 CegarLoopUtils]: For program point L191(line 191) no Hoare annotation was computed. [2021-01-06 14:17:10,176 INFO L189 CegarLoopUtils]: For program point L125(line 125) no Hoare annotation was computed. [2021-01-06 14:17:10,177 INFO L189 CegarLoopUtils]: For program point L59(line 59) no Hoare annotation was computed. [2021-01-06 14:17:10,177 INFO L189 CegarLoopUtils]: For program point L852(lines 852 880) no Hoare annotation was computed. [2021-01-06 14:17:10,177 INFO L189 CegarLoopUtils]: For program point L654(lines 654 880) no Hoare annotation was computed. [2021-01-06 14:17:10,177 INFO L189 CegarLoopUtils]: For program point L522(lines 522 880) no Hoare annotation was computed. [2021-01-06 14:17:10,177 INFO L189 CegarLoopUtils]: For program point L787(lines 787 880) no Hoare annotation was computed. [2021-01-06 14:17:10,177 INFO L189 CegarLoopUtils]: For program point L589(lines 589 880) no Hoare annotation was computed. [2021-01-06 14:17:10,177 INFO L189 CegarLoopUtils]: For program point L193-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,177 INFO L189 CegarLoopUtils]: For program point L127-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,177 INFO L189 CegarLoopUtils]: For program point L61-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,177 INFO L189 CegarLoopUtils]: For program point L722(lines 722 880) no Hoare annotation was computed. [2021-01-06 14:17:10,178 INFO L189 CegarLoopUtils]: For program point L194(line 194) no Hoare annotation was computed. [2021-01-06 14:17:10,178 INFO L189 CegarLoopUtils]: For program point L128(line 128) no Hoare annotation was computed. [2021-01-06 14:17:10,178 INFO L189 CegarLoopUtils]: For program point L62(line 62) no Hoare annotation was computed. [2021-01-06 14:17:10,178 INFO L189 CegarLoopUtils]: For program point L459(lines 459 880) no Hoare annotation was computed. [2021-01-06 14:17:10,178 INFO L189 CegarLoopUtils]: For program point L327(lines 327 880) no Hoare annotation was computed. [2021-01-06 14:17:10,178 INFO L189 CegarLoopUtils]: For program point L394(lines 394 880) no Hoare annotation was computed. [2021-01-06 14:17:10,178 INFO L189 CegarLoopUtils]: For program point L262(lines 262 880) no Hoare annotation was computed. [2021-01-06 14:17:10,178 INFO L189 CegarLoopUtils]: For program point L196-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,178 INFO L189 CegarLoopUtils]: For program point L130-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,178 INFO L189 CegarLoopUtils]: For program point L64-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,178 INFO L189 CegarLoopUtils]: For program point L197(line 197) no Hoare annotation was computed. [2021-01-06 14:17:10,179 INFO L189 CegarLoopUtils]: For program point L131(line 131) no Hoare annotation was computed. [2021-01-06 14:17:10,179 INFO L189 CegarLoopUtils]: For program point L65(line 65) no Hoare annotation was computed. [2021-01-06 14:17:10,179 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 14:17:10,179 INFO L189 CegarLoopUtils]: For program point L858(lines 858 880) no Hoare annotation was computed. [2021-01-06 14:17:10,179 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2021-01-06 14:17:10,179 INFO L189 CegarLoopUtils]: For program point L660(lines 660 880) no Hoare annotation was computed. [2021-01-06 14:17:10,179 INFO L189 CegarLoopUtils]: For program point L528(lines 528 880) no Hoare annotation was computed. [2021-01-06 14:17:10,179 INFO L189 CegarLoopUtils]: For program point L793(lines 793 880) no Hoare annotation was computed. [2021-01-06 14:17:10,179 INFO L189 CegarLoopUtils]: For program point L595(lines 595 880) no Hoare annotation was computed. [2021-01-06 14:17:10,179 INFO L189 CegarLoopUtils]: For program point L199-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,180 INFO L189 CegarLoopUtils]: For program point L133-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,180 INFO L189 CegarLoopUtils]: For program point L67-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,180 INFO L189 CegarLoopUtils]: For program point L728(lines 728 880) no Hoare annotation was computed. [2021-01-06 14:17:10,180 INFO L189 CegarLoopUtils]: For program point L464(lines 464 880) no Hoare annotation was computed. [2021-01-06 14:17:10,180 INFO L189 CegarLoopUtils]: For program point L200(line 200) no Hoare annotation was computed. [2021-01-06 14:17:10,180 INFO L189 CegarLoopUtils]: For program point L134(line 134) no Hoare annotation was computed. [2021-01-06 14:17:10,180 INFO L189 CegarLoopUtils]: For program point L68(line 68) no Hoare annotation was computed. [2021-01-06 14:17:10,180 INFO L189 CegarLoopUtils]: For program point L333(lines 333 880) no Hoare annotation was computed. [2021-01-06 14:17:10,180 INFO L189 CegarLoopUtils]: For program point L400(lines 400 880) no Hoare annotation was computed. [2021-01-06 14:17:10,180 INFO L189 CegarLoopUtils]: For program point L268(lines 268 880) no Hoare annotation was computed. [2021-01-06 14:17:10,180 INFO L189 CegarLoopUtils]: For program point L202-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,181 INFO L189 CegarLoopUtils]: For program point L136-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,181 INFO L189 CegarLoopUtils]: For program point L70-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,181 INFO L189 CegarLoopUtils]: For program point L203(line 203) no Hoare annotation was computed. [2021-01-06 14:17:10,181 INFO L189 CegarLoopUtils]: For program point L137(line 137) no Hoare annotation was computed. [2021-01-06 14:17:10,181 INFO L189 CegarLoopUtils]: For program point L71(line 71) no Hoare annotation was computed. [2021-01-06 14:17:10,181 INFO L189 CegarLoopUtils]: For program point L864(lines 864 880) no Hoare annotation was computed. [2021-01-06 14:17:10,181 INFO L189 CegarLoopUtils]: For program point L666(lines 666 880) no Hoare annotation was computed. [2021-01-06 14:17:10,181 INFO L189 CegarLoopUtils]: For program point L534(lines 534 880) no Hoare annotation was computed. [2021-01-06 14:17:10,181 INFO L189 CegarLoopUtils]: For program point L799(lines 799 880) no Hoare annotation was computed. [2021-01-06 14:17:10,181 INFO L189 CegarLoopUtils]: For program point L601(lines 601 880) no Hoare annotation was computed. [2021-01-06 14:17:10,181 INFO L189 CegarLoopUtils]: For program point L205-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,182 INFO L189 CegarLoopUtils]: For program point L139-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,182 INFO L189 CegarLoopUtils]: For program point L73-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,182 INFO L189 CegarLoopUtils]: For program point L734(lines 734 880) no Hoare annotation was computed. [2021-01-06 14:17:10,182 INFO L189 CegarLoopUtils]: For program point L470(lines 470 880) no Hoare annotation was computed. [2021-01-06 14:17:10,182 INFO L189 CegarLoopUtils]: For program point L206(line 206) no Hoare annotation was computed. [2021-01-06 14:17:10,182 INFO L189 CegarLoopUtils]: For program point L140(line 140) no Hoare annotation was computed. [2021-01-06 14:17:10,182 INFO L189 CegarLoopUtils]: For program point L74(line 74) no Hoare annotation was computed. [2021-01-06 14:17:10,182 INFO L189 CegarLoopUtils]: For program point L339(lines 339 880) no Hoare annotation was computed. [2021-01-06 14:17:10,182 INFO L189 CegarLoopUtils]: For program point L406(lines 406 880) no Hoare annotation was computed. [2021-01-06 14:17:10,182 INFO L189 CegarLoopUtils]: For program point L274(lines 274 880) no Hoare annotation was computed. [2021-01-06 14:17:10,182 INFO L189 CegarLoopUtils]: For program point L208-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,182 INFO L189 CegarLoopUtils]: For program point L142-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,183 INFO L189 CegarLoopUtils]: For program point L76-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,183 INFO L189 CegarLoopUtils]: For program point L869(lines 869 880) no Hoare annotation was computed. [2021-01-06 14:17:10,183 INFO L189 CegarLoopUtils]: For program point L209(line 209) no Hoare annotation was computed. [2021-01-06 14:17:10,183 INFO L189 CegarLoopUtils]: For program point L143(line 143) no Hoare annotation was computed. [2021-01-06 14:17:10,183 INFO L189 CegarLoopUtils]: For program point L77(line 77) no Hoare annotation was computed. [2021-01-06 14:17:10,183 INFO L189 CegarLoopUtils]: For program point L672(lines 672 880) no Hoare annotation was computed. [2021-01-06 14:17:10,183 INFO L189 CegarLoopUtils]: For program point L540(lines 540 880) no Hoare annotation was computed. [2021-01-06 14:17:10,183 INFO L189 CegarLoopUtils]: For program point L805(lines 805 880) no Hoare annotation was computed. [2021-01-06 14:17:10,183 INFO L189 CegarLoopUtils]: For program point L607(lines 607 880) no Hoare annotation was computed. [2021-01-06 14:17:10,183 INFO L189 CegarLoopUtils]: For program point L211-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,183 INFO L189 CegarLoopUtils]: For program point L145-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,184 INFO L189 CegarLoopUtils]: For program point L79-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,184 INFO L189 CegarLoopUtils]: For program point L740(lines 740 880) no Hoare annotation was computed. [2021-01-06 14:17:10,184 INFO L189 CegarLoopUtils]: For program point L212(line 212) no Hoare annotation was computed. [2021-01-06 14:17:10,184 INFO L189 CegarLoopUtils]: For program point L146(line 146) no Hoare annotation was computed. [2021-01-06 14:17:10,184 INFO L189 CegarLoopUtils]: For program point L80(line 80) no Hoare annotation was computed. [2021-01-06 14:17:10,184 INFO L189 CegarLoopUtils]: For program point L477(lines 477 880) no Hoare annotation was computed. [2021-01-06 14:17:10,184 INFO L189 CegarLoopUtils]: For program point L345(lines 345 880) no Hoare annotation was computed. [2021-01-06 14:17:10,184 INFO L189 CegarLoopUtils]: For program point L279(lines 279 880) no Hoare annotation was computed. [2021-01-06 14:17:10,184 INFO L189 CegarLoopUtils]: For program point L412(lines 412 880) no Hoare annotation was computed. [2021-01-06 14:17:10,184 INFO L189 CegarLoopUtils]: For program point L148-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,184 INFO L189 CegarLoopUtils]: For program point L82-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,184 INFO L189 CegarLoopUtils]: For program point L875(lines 875 880) no Hoare annotation was computed. [2021-01-06 14:17:10,185 INFO L189 CegarLoopUtils]: For program point L149(line 149) no Hoare annotation was computed. [2021-01-06 14:17:10,185 INFO L189 CegarLoopUtils]: For program point L83(line 83) no Hoare annotation was computed. [2021-01-06 14:17:10,185 INFO L189 CegarLoopUtils]: For program point L678(lines 678 880) no Hoare annotation was computed. [2021-01-06 14:17:10,185 INFO L189 CegarLoopUtils]: For program point L546(lines 546 880) no Hoare annotation was computed. [2021-01-06 14:17:10,185 INFO L189 CegarLoopUtils]: For program point L811(lines 811 880) no Hoare annotation was computed. [2021-01-06 14:17:10,185 INFO L189 CegarLoopUtils]: For program point L745(lines 745 880) no Hoare annotation was computed. [2021-01-06 14:17:10,185 INFO L189 CegarLoopUtils]: For program point L613(lines 613 880) no Hoare annotation was computed. [2021-01-06 14:17:10,185 INFO L189 CegarLoopUtils]: For program point L151-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,185 INFO L189 CegarLoopUtils]: For program point L85-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,185 INFO L189 CegarLoopUtils]: For program point L482(lines 482 880) no Hoare annotation was computed. [2021-01-06 14:17:10,185 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 14:17:10,185 INFO L189 CegarLoopUtils]: For program point L152(line 152) no Hoare annotation was computed. [2021-01-06 14:17:10,186 INFO L189 CegarLoopUtils]: For program point L86(line 86) no Hoare annotation was computed. [2021-01-06 14:17:10,186 INFO L189 CegarLoopUtils]: For program point L351(lines 351 880) no Hoare annotation was computed. [2021-01-06 14:17:10,186 INFO L189 CegarLoopUtils]: For program point L285(lines 285 880) no Hoare annotation was computed. [2021-01-06 14:17:10,186 INFO L189 CegarLoopUtils]: For program point L418(lines 418 880) no Hoare annotation was computed. [2021-01-06 14:17:10,186 INFO L189 CegarLoopUtils]: For program point L154-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,186 INFO L189 CegarLoopUtils]: For program point L88-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,187 INFO L185 CegarLoopUtils]: At program point L881(lines 30 882) the Hoare annotation is: (let ((.cse4 (+ ~a12~0 43))) (let ((.cse14 (<= 82 ~a12~0)) (.cse16 (<= ~a12~0 10)) (.cse7 (<= 9 ~a15~0)) (.cse8 (< 95380 ~a12~0)) (.cse0 (<= ~a15~0 7)) (.cse12 (< 0 .cse4)) (.cse15 (<= 7 ~a21~0)) (.cse11 (<= (+ ~a12~0 49) 0)) (.cse9 (<= ~a15~0 8)) (.cse5 (<= ~a21~0 6)) (.cse6 (<= ~a15~0 6)) (.cse13 (<= ~a12~0 11)) (.cse17 (<= 10 ~a21~0)) (.cse1 (<= 8 ~a21~0)) (.cse2 (= ~a24~0 1)) (.cse10 (< 18 ~a12~0)) (.cse3 (<= ~a21~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse5 .cse6) (and (<= ~a12~0 95434) .cse2 .cse7 .cse8) (and (<= ~a12~0 75) .cse1 .cse2 .cse9 (<= ~a21~0 9) .cse10) (and .cse0 .cse11 .cse2 .cse3) (and .cse12 .cse13 .cse1 .cse2 .cse9) (and .cse14 .cse15 .cse2 .cse7) (and .cse14 (<= ~a12~0 73281) .cse1 .cse2 .cse3) (and .cse12 .cse16 .cse1 .cse2 .cse3) (and (<= 8 ~a15~0) .cse12 .cse16 .cse2 .cse9) (and .cse1 (<= (+ ~a12~0 526768) 0) .cse2 .cse7 .cse3) (and .cse0 .cse12 .cse1 .cse2) (and .cse2 .cse17 .cse8) (and .cse0 .cse12 .cse2 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse3 (<= ~a12~0 76)) (and (<= ~a21~0 7) .cse15 .cse11 .cse2 .cse9) (and .cse2 .cse9 (<= 286349 ~a12~0) .cse5) (and .cse2 .cse6) (and .cse13 .cse2 .cse17) (and .cse1 .cse2 (<= ~a12~0 72) .cse10 .cse3)))) [2021-01-06 14:17:10,187 INFO L189 CegarLoopUtils]: For program point L551(lines 551 880) no Hoare annotation was computed. [2021-01-06 14:17:10,187 INFO L189 CegarLoopUtils]: For program point L221(lines 221 880) no Hoare annotation was computed. [2021-01-06 14:17:10,187 INFO L189 CegarLoopUtils]: For program point L155(line 155) no Hoare annotation was computed. [2021-01-06 14:17:10,187 INFO L189 CegarLoopUtils]: For program point L89(line 89) no Hoare annotation was computed. [2021-01-06 14:17:10,187 INFO L189 CegarLoopUtils]: For program point L684(lines 684 880) no Hoare annotation was computed. [2021-01-06 14:17:10,187 INFO L189 CegarLoopUtils]: For program point L817(lines 817 880) no Hoare annotation was computed. [2021-01-06 14:17:10,187 INFO L189 CegarLoopUtils]: For program point L751(lines 751 880) no Hoare annotation was computed. [2021-01-06 14:17:10,188 INFO L189 CegarLoopUtils]: For program point L619(lines 619 880) no Hoare annotation was computed. [2021-01-06 14:17:10,188 INFO L189 CegarLoopUtils]: For program point L157-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,188 INFO L189 CegarLoopUtils]: For program point L91-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,188 INFO L192 CegarLoopUtils]: At program point L884(lines 884 900) the Hoare annotation is: true [2021-01-06 14:17:10,188 INFO L189 CegarLoopUtils]: For program point L488(lines 488 880) no Hoare annotation was computed. [2021-01-06 14:17:10,188 INFO L189 CegarLoopUtils]: For program point L290(lines 290 880) no Hoare annotation was computed. [2021-01-06 14:17:10,188 INFO L189 CegarLoopUtils]: For program point L158(line 158) no Hoare annotation was computed. [2021-01-06 14:17:10,188 INFO L189 CegarLoopUtils]: For program point L92(line 92) no Hoare annotation was computed. [2021-01-06 14:17:10,188 INFO L189 CegarLoopUtils]: For program point L687(lines 687 880) no Hoare annotation was computed. [2021-01-06 14:17:10,188 INFO L189 CegarLoopUtils]: For program point L357(lines 357 880) no Hoare annotation was computed. [2021-01-06 14:17:10,188 INFO L189 CegarLoopUtils]: For program point L424(lines 424 880) no Hoare annotation was computed. [2021-01-06 14:17:10,189 INFO L189 CegarLoopUtils]: For program point L160-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,189 INFO L189 CegarLoopUtils]: For program point L94-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,189 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 14:17:10,189 INFO L189 CegarLoopUtils]: For program point L557(lines 557 880) no Hoare annotation was computed. [2021-01-06 14:17:10,189 INFO L189 CegarLoopUtils]: For program point L227(lines 227 880) no Hoare annotation was computed. [2021-01-06 14:17:10,189 INFO L189 CegarLoopUtils]: For program point L161(line 161) no Hoare annotation was computed. [2021-01-06 14:17:10,189 INFO L189 CegarLoopUtils]: For program point L95(line 95) no Hoare annotation was computed. [2021-01-06 14:17:10,189 INFO L189 CegarLoopUtils]: For program point L757(lines 757 880) no Hoare annotation was computed. [2021-01-06 14:17:10,189 INFO L189 CegarLoopUtils]: For program point L625(lines 625 880) no Hoare annotation was computed. [2021-01-06 14:17:10,189 INFO L189 CegarLoopUtils]: For program point L163-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,190 INFO L189 CegarLoopUtils]: For program point L97-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,190 INFO L189 CegarLoopUtils]: For program point L31(lines 31 33) no Hoare annotation was computed. [2021-01-06 14:17:10,190 INFO L189 CegarLoopUtils]: For program point L31-2(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,190 INFO L189 CegarLoopUtils]: For program point L824(lines 824 880) no Hoare annotation was computed. [2021-01-06 14:17:10,190 INFO L185 CegarLoopUtils]: At program point L890-2(lines 890 899) the Hoare annotation is: (let ((.cse4 (+ ~a12~0 43))) (let ((.cse14 (<= 82 ~a12~0)) (.cse16 (<= ~a12~0 10)) (.cse7 (<= 9 ~a15~0)) (.cse8 (< 95380 ~a12~0)) (.cse0 (<= ~a15~0 7)) (.cse12 (< 0 .cse4)) (.cse15 (<= 7 ~a21~0)) (.cse11 (<= (+ ~a12~0 49) 0)) (.cse9 (<= ~a15~0 8)) (.cse5 (<= ~a21~0 6)) (.cse6 (<= ~a15~0 6)) (.cse13 (<= ~a12~0 11)) (.cse17 (<= 10 ~a21~0)) (.cse1 (<= 8 ~a21~0)) (.cse2 (= ~a24~0 1)) (.cse10 (< 18 ~a12~0)) (.cse3 (<= ~a21~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse5 .cse6) (and (<= ~a12~0 95434) .cse2 .cse7 .cse8) (and (<= ~a12~0 75) .cse1 .cse2 .cse9 (<= ~a21~0 9) .cse10) (and .cse0 .cse11 .cse2 .cse3) (and .cse12 .cse13 .cse1 .cse2 .cse9) (and .cse14 .cse15 .cse2 .cse7) (and .cse14 (<= ~a12~0 73281) .cse1 .cse2 .cse3) (and .cse12 .cse16 .cse1 .cse2 .cse3) (and (<= 8 ~a15~0) .cse12 .cse16 .cse2 .cse9) (and .cse1 (<= (+ ~a12~0 526768) 0) .cse2 .cse7 .cse3) (and .cse0 .cse12 .cse1 .cse2) (and .cse2 .cse17 .cse8) (and .cse0 .cse12 .cse2 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse3 (<= ~a12~0 76)) (and (<= ~a21~0 7) .cse15 .cse11 .cse2 .cse9) (and .cse2 .cse9 (<= 286349 ~a12~0) .cse5) (and .cse2 .cse6) (and .cse13 .cse2 .cse17) (and .cse1 .cse2 (<= ~a12~0 72) .cse10 .cse3)))) [2021-01-06 14:17:10,190 INFO L189 CegarLoopUtils]: For program point L494(lines 494 880) no Hoare annotation was computed. [2021-01-06 14:17:10,190 INFO L189 CegarLoopUtils]: For program point L296(lines 296 880) no Hoare annotation was computed. [2021-01-06 14:17:10,190 INFO L189 CegarLoopUtils]: For program point L164(line 164) no Hoare annotation was computed. [2021-01-06 14:17:10,191 INFO L189 CegarLoopUtils]: For program point L98(line 98) no Hoare annotation was computed. [2021-01-06 14:17:10,191 INFO L189 CegarLoopUtils]: For program point L32(line 32) no Hoare annotation was computed. [2021-01-06 14:17:10,191 INFO L189 CegarLoopUtils]: For program point L693(lines 693 880) no Hoare annotation was computed. [2021-01-06 14:17:10,191 INFO L189 CegarLoopUtils]: For program point L363(lines 363 880) no Hoare annotation was computed. [2021-01-06 14:17:10,191 INFO L189 CegarLoopUtils]: For program point L562(lines 562 880) no Hoare annotation was computed. [2021-01-06 14:17:10,191 INFO L189 CegarLoopUtils]: For program point L430(lines 430 880) no Hoare annotation was computed. [2021-01-06 14:17:10,191 INFO L189 CegarLoopUtils]: For program point L166-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,191 INFO L189 CegarLoopUtils]: For program point L100-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,191 INFO L189 CegarLoopUtils]: For program point L34-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:10,192 INFO L189 CegarLoopUtils]: For program point L233(lines 233 880) no Hoare annotation was computed. [2021-01-06 14:17:10,192 INFO L189 CegarLoopUtils]: For program point L167(line 167) no Hoare annotation was computed. [2021-01-06 14:17:10,192 INFO L189 CegarLoopUtils]: For program point L101(line 101) no Hoare annotation was computed. [2021-01-06 14:17:10,192 INFO L189 CegarLoopUtils]: For program point L35(line 35) no Hoare annotation was computed. [2021-01-06 14:17:10,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 02:17:10 BoogieIcfgContainer [2021-01-06 14:17:10,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 14:17:10,227 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 14:17:10,227 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 14:17:10,227 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 14:17:10,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:15:30" (3/4) ... [2021-01-06 14:17:10,232 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 14:17:10,262 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-01-06 14:17:10,264 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 14:17:10,265 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 14:17:10,267 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 14:17:10,457 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem14_label45.c-witness.graphml [2021-01-06 14:17:10,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 14:17:10,465 INFO L168 Benchmark]: Toolchain (without parser) took 102894.14 ms. Allocated memory was 155.2 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 127.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 8.0 GB. [2021-01-06 14:17:10,465 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 155.2 MB. Free memory is still 138.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 14:17:10,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1080.44 ms. Allocated memory is still 155.2 MB. Free memory was 127.7 MB in the beginning and 122.0 MB in the end (delta: 5.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:10,467 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.63 ms. Allocated memory is still 155.2 MB. Free memory was 122.0 MB in the beginning and 112.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:10,468 INFO L168 Benchmark]: Boogie Preprocessor took 170.78 ms. Allocated memory is still 155.2 MB. Free memory was 112.6 MB in the beginning and 106.3 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:10,468 INFO L168 Benchmark]: RCFGBuilder took 2004.33 ms. Allocated memory was 155.2 MB in the beginning and 232.8 MB in the end (delta: 77.6 MB). Free memory was 106.3 MB in the beginning and 171.6 MB in the end (delta: -65.4 MB). Peak memory consumption was 63.1 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:10,469 INFO L168 Benchmark]: TraceAbstraction took 99236.13 ms. Allocated memory was 232.8 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 171.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 953.5 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:10,469 INFO L168 Benchmark]: Witness Printer took 230.09 ms. Allocated memory is still 2.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:10,471 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 155.2 MB. Free memory is still 138.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1080.44 ms. Allocated memory is still 155.2 MB. Free memory was 127.7 MB in the beginning and 122.0 MB in the end (delta: 5.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 153.63 ms. Allocated memory is still 155.2 MB. Free memory was 122.0 MB in the beginning and 112.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 170.78 ms. Allocated memory is still 155.2 MB. Free memory was 112.6 MB in the beginning and 106.3 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2004.33 ms. Allocated memory was 155.2 MB in the beginning and 232.8 MB in the end (delta: 77.6 MB). Free memory was 106.3 MB in the beginning and 171.6 MB in the end (delta: -65.4 MB). Peak memory consumption was 63.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 99236.13 ms. Allocated memory was 232.8 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 171.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 953.5 MB. Max. memory is 8.0 GB. * Witness Printer took 230.09 ms. Allocated memory is still 2.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 122]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((((((((((((((((((((a15 <= 7 && 8 <= a21) && a24 == 1) && a21 <= 8) || ((a12 + 43 <= 0 && a21 <= 6) && a15 <= 6)) || (((a12 <= 95434 && a24 == 1) && 9 <= a15) && 95380 < a12)) || (((((a12 <= 75 && 8 <= a21) && a24 == 1) && a15 <= 8) && a21 <= 9) && 18 < a12)) || (((a15 <= 7 && a12 + 49 <= 0) && a24 == 1) && a21 <= 8)) || ((((0 < a12 + 43 && a12 <= 11) && 8 <= a21) && a24 == 1) && a15 <= 8)) || (((82 <= a12 && 7 <= a21) && a24 == 1) && 9 <= a15)) || ((((82 <= a12 && a12 <= 73281) && 8 <= a21) && a24 == 1) && a21 <= 8)) || ((((0 < a12 + 43 && a12 <= 10) && 8 <= a21) && a24 == 1) && a21 <= 8)) || ((((8 <= a15 && 0 < a12 + 43) && a12 <= 10) && a24 == 1) && a15 <= 8)) || ((((8 <= a21 && a12 + 526768 <= 0) && a24 == 1) && 9 <= a15) && a21 <= 8)) || (((a15 <= 7 && 0 < a12 + 43) && 8 <= a21) && a24 == 1)) || ((a24 == 1 && 10 <= a21) && 95380 < a12)) || (((a15 <= 7 && 0 < a12 + 43) && a24 == 1) && a21 <= 6)) || (((((8 <= a21 && a24 == 1) && a15 <= 8) && 18 < a12) && a21 <= 8) && a12 <= 76)) || ((((a21 <= 7 && 7 <= a21) && a12 + 49 <= 0) && a24 == 1) && a15 <= 8)) || (((a24 == 1 && a15 <= 8) && 286349 <= a12) && a21 <= 6)) || (a24 == 1 && a15 <= 6)) || ((a12 <= 11 && a24 == 1) && 10 <= a21)) || ((((8 <= a21 && a24 == 1) && a12 <= 72) && 18 < a12) && a21 <= 8) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((((((((a15 <= 7 && 8 <= a21) && a24 == 1) && a21 <= 8) || ((a12 + 43 <= 0 && a21 <= 6) && a15 <= 6)) || (((a12 <= 95434 && a24 == 1) && 9 <= a15) && 95380 < a12)) || (((((a12 <= 75 && 8 <= a21) && a24 == 1) && a15 <= 8) && a21 <= 9) && 18 < a12)) || (((a15 <= 7 && a12 + 49 <= 0) && a24 == 1) && a21 <= 8)) || ((((0 < a12 + 43 && a12 <= 11) && 8 <= a21) && a24 == 1) && a15 <= 8)) || (((82 <= a12 && 7 <= a21) && a24 == 1) && 9 <= a15)) || ((((82 <= a12 && a12 <= 73281) && 8 <= a21) && a24 == 1) && a21 <= 8)) || ((((0 < a12 + 43 && a12 <= 10) && 8 <= a21) && a24 == 1) && a21 <= 8)) || ((((8 <= a15 && 0 < a12 + 43) && a12 <= 10) && a24 == 1) && a15 <= 8)) || ((((8 <= a21 && a12 + 526768 <= 0) && a24 == 1) && 9 <= a15) && a21 <= 8)) || (((a15 <= 7 && 0 < a12 + 43) && 8 <= a21) && a24 == 1)) || ((a24 == 1 && 10 <= a21) && 95380 < a12)) || (((a15 <= 7 && 0 < a12 + 43) && a24 == 1) && a21 <= 6)) || (((((8 <= a21 && a24 == 1) && a15 <= 8) && 18 < a12) && a21 <= 8) && a12 <= 76)) || ((((a21 <= 7 && 7 <= a21) && a12 + 49 <= 0) && a24 == 1) && a15 <= 8)) || (((a24 == 1 && a15 <= 8) && 286349 <= a12) && a21 <= 6)) || (a24 == 1 && a15 <= 6)) || ((a12 <= 11 && a24 == 1) && 10 <= a21)) || ((((8 <= a21 && a24 == 1) && a12 <= 72) && 18 < a12) && a21 <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 96.1s, OverallIterations: 28, TraceHistogramMax: 19, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3571 SDtfs, 3932 SDslu, 281 SDs, 0 SdLazy, 22704 SolverSat, 1374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11316 GetRequests, 11223 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6056occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 5696 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 89 NumberOfFragments, 595 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5630 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2684 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 28.0s InterpolantComputationTime, 34198 NumberOfCodeBlocks, 34198 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 34156 ConstructedInterpolants, 0 QuantifiedInterpolants, 95441000 SizeOfPredicates, 1 NumberOfNonLiveVariables, 14193 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 42 InterpolantComputations, 25 PerfectInterpolantSequences, 137326/141660 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...