/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/Problem11_label26.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 03:39:57,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 03:39:57,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 03:39:57,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 03:39:57,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 03:39:57,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 03:39:57,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 03:39:57,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 03:39:57,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 03:39:57,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 03:39:57,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 03:39:57,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 03:39:57,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 03:39:57,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 03:39:57,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 03:39:57,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 03:39:57,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 03:39:57,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 03:39:57,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 03:39:57,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 03:39:57,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 03:39:57,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 03:39:57,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 03:39:57,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 03:39:57,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 03:39:57,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 03:39:57,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 03:39:57,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 03:39:57,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 03:39:57,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 03:39:57,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 03:39:57,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 03:39:57,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 03:39:57,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 03:39:57,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 03:39:57,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 03:39:57,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 03:39:57,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 03:39:57,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 03:39:57,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 03:39:57,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 03:39:57,867 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 03:39:57,892 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 03:39:57,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 03:39:57,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 03:39:57,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 03:39:57,895 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 03:39:57,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 03:39:57,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 03:39:57,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 03:39:57,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 03:39:57,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 03:39:57,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 03:39:57,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 03:39:57,896 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 03:39:57,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 03:39:57,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 03:39:57,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 03:39:57,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 03:39:57,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 03:39:57,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 03:39:57,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 03:39:57,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 03:39:57,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 03:39:57,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 03:39:57,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 03:39:57,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 03:39:57,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 03:39:58,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 03:39:58,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 03:39:58,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 03:39:58,322 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 03:39:58,323 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 03:39:58,324 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2020-12-23 03:39:58,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e024db0eb/ddbbf0b2afa242f18accafb1504f2b18/FLAGe390b1d99 [2020-12-23 03:39:59,136 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 03:39:59,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2020-12-23 03:39:59,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e024db0eb/ddbbf0b2afa242f18accafb1504f2b18/FLAGe390b1d99 [2020-12-23 03:39:59,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e024db0eb/ddbbf0b2afa242f18accafb1504f2b18 [2020-12-23 03:39:59,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 03:39:59,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 03:39:59,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 03:39:59,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 03:39:59,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 03:39:59,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:39:59" (1/1) ... [2020-12-23 03:39:59,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5821f10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:59, skipping insertion in model container [2020-12-23 03:39:59,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:39:59" (1/1) ... [2020-12-23 03:39:59,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 03:39:59,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 03:39:59,778 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/Problem11_label26.c[5699,5712] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2020-12-23 03:40:00,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 03:40:00,076 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 03:40:00,152 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/Problem11_label26.c[5699,5712] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2020-12-23 03:40:00,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 03:40:00,347 INFO L208 MainTranslator]: Completed translation [2020-12-23 03:40:00,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:40:00 WrapperNode [2020-12-23 03:40:00,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 03:40:00,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 03:40:00,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 03:40:00,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 03:40:00,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:40:00" (1/1) ... [2020-12-23 03:40:00,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:40:00" (1/1) ... [2020-12-23 03:40:00,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 03:40:00,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 03:40:00,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 03:40:00,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 03:40:00,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:40:00" (1/1) ... [2020-12-23 03:40:00,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:40:00" (1/1) ... [2020-12-23 03:40:00,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:40:00" (1/1) ... [2020-12-23 03:40:00,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:40:00" (1/1) ... [2020-12-23 03:40:00,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:40:00" (1/1) ... [2020-12-23 03:40:00,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:40:00" (1/1) ... [2020-12-23 03:40:00,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:40:00" (1/1) ... [2020-12-23 03:40:00,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 03:40:00,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 03:40:00,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 03:40:00,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 03:40:00,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:40:00" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 03:40:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 03:40:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 03:40:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 03:40:00,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 03:40:02,440 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 03:40:02,440 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 03:40:02,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:40:02 BoogieIcfgContainer [2020-12-23 03:40:02,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 03:40:02,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 03:40:02,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 03:40:02,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 03:40:02,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:39:59" (1/3) ... [2020-12-23 03:40:02,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377b0458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:40:02, skipping insertion in model container [2020-12-23 03:40:02,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:40:00" (2/3) ... [2020-12-23 03:40:02,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377b0458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:40:02, skipping insertion in model container [2020-12-23 03:40:02,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:40:02" (3/3) ... [2020-12-23 03:40:02,451 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label26.c [2020-12-23 03:40:02,457 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 03:40:02,463 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 03:40:02,481 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 03:40:02,517 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 03:40:02,518 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 03:40:02,518 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 03:40:02,518 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 03:40:02,518 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 03:40:02,518 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 03:40:02,518 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 03:40:02,518 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 03:40:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2020-12-23 03:40:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 03:40:02,547 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:02,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:02,548 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:02,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1453294289, now seen corresponding path program 1 times [2020-12-23 03:40:02,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:02,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885933638] [2020-12-23 03:40:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:40:02,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885933638] [2020-12-23 03:40:02,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:02,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:40:02,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76685442] [2020-12-23 03:40:02,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:02,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:02,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:02,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:03,000 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 3 states. [2020-12-23 03:40:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:04,369 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2020-12-23 03:40:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:04,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-23 03:40:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:04,399 INFO L225 Difference]: With dead ends: 776 [2020-12-23 03:40:04,400 INFO L226 Difference]: Without dead ends: 413 [2020-12-23 03:40:04,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-12-23 03:40:04,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2020-12-23 03:40:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2020-12-23 03:40:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2020-12-23 03:40:04,478 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 39 [2020-12-23 03:40:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:04,479 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2020-12-23 03:40:04,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2020-12-23 03:40:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 03:40:04,484 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:04,485 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:04,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 03:40:04,486 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:04,487 INFO L82 PathProgramCache]: Analyzing trace with hash 142001080, now seen corresponding path program 1 times [2020-12-23 03:40:04,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:04,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409659376] [2020-12-23 03:40:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:40:04,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409659376] [2020-12-23 03:40:04,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:04,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:40:04,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082725691] [2020-12-23 03:40:04,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:04,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:04,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:04,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:04,788 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand 3 states. [2020-12-23 03:40:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:05,847 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2020-12-23 03:40:05,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:05,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 03:40:05,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:05,853 INFO L225 Difference]: With dead ends: 1209 [2020-12-23 03:40:05,853 INFO L226 Difference]: Without dead ends: 800 [2020-12-23 03:40:05,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2020-12-23 03:40:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2020-12-23 03:40:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-12-23 03:40:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2020-12-23 03:40:05,892 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 107 [2020-12-23 03:40:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:05,893 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2020-12-23 03:40:05,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2020-12-23 03:40:05,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 03:40:05,896 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:05,897 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:05,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 03:40:05,897 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:05,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:05,898 INFO L82 PathProgramCache]: Analyzing trace with hash 412464125, now seen corresponding path program 1 times [2020-12-23 03:40:05,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:05,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274845348] [2020-12-23 03:40:05,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:40:06,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274845348] [2020-12-23 03:40:06,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:06,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:40:06,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687303478] [2020-12-23 03:40:06,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:06,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:06,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:06,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:06,071 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand 3 states. [2020-12-23 03:40:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:07,022 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2020-12-23 03:40:07,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:07,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2020-12-23 03:40:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:07,029 INFO L225 Difference]: With dead ends: 1941 [2020-12-23 03:40:07,029 INFO L226 Difference]: Without dead ends: 1156 [2020-12-23 03:40:07,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2020-12-23 03:40:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156. [2020-12-23 03:40:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2020-12-23 03:40:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2020-12-23 03:40:07,059 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 109 [2020-12-23 03:40:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:07,059 INFO L481 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2020-12-23 03:40:07,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2020-12-23 03:40:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-12-23 03:40:07,063 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:07,063 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:07,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 03:40:07,064 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:07,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:07,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1192776204, now seen corresponding path program 1 times [2020-12-23 03:40:07,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:07,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216147064] [2020-12-23 03:40:07,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-23 03:40:07,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216147064] [2020-12-23 03:40:07,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:07,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:40:07,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806966766] [2020-12-23 03:40:07,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:07,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:07,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:07,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:07,334 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand 3 states. [2020-12-23 03:40:08,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:08,422 INFO L93 Difference]: Finished difference Result 3056 states and 3914 transitions. [2020-12-23 03:40:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:08,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2020-12-23 03:40:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:08,434 INFO L225 Difference]: With dead ends: 3056 [2020-12-23 03:40:08,434 INFO L226 Difference]: Without dead ends: 1902 [2020-12-23 03:40:08,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2020-12-23 03:40:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1901. [2020-12-23 03:40:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1901 states. [2020-12-23 03:40:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2318 transitions. [2020-12-23 03:40:08,479 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2318 transitions. Word has length 151 [2020-12-23 03:40:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:08,480 INFO L481 AbstractCegarLoop]: Abstraction has 1901 states and 2318 transitions. [2020-12-23 03:40:08,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2318 transitions. [2020-12-23 03:40:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2020-12-23 03:40:08,483 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:08,484 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:08,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 03:40:08,484 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:08,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:08,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1825758429, now seen corresponding path program 1 times [2020-12-23 03:40:08,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:08,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959910088] [2020-12-23 03:40:08,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:40:08,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959910088] [2020-12-23 03:40:08,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:08,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:08,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460396358] [2020-12-23 03:40:08,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:08,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:08,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:08,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:08,619 INFO L87 Difference]: Start difference. First operand 1901 states and 2318 transitions. Second operand 3 states. [2020-12-23 03:40:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:09,598 INFO L93 Difference]: Finished difference Result 4382 states and 5509 transitions. [2020-12-23 03:40:09,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:09,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2020-12-23 03:40:09,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:09,612 INFO L225 Difference]: With dead ends: 4382 [2020-12-23 03:40:09,613 INFO L226 Difference]: Without dead ends: 2667 [2020-12-23 03:40:09,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2020-12-23 03:40:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2664. [2020-12-23 03:40:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2020-12-23 03:40:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3289 transitions. [2020-12-23 03:40:09,670 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3289 transitions. Word has length 166 [2020-12-23 03:40:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:09,670 INFO L481 AbstractCegarLoop]: Abstraction has 2664 states and 3289 transitions. [2020-12-23 03:40:09,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3289 transitions. [2020-12-23 03:40:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2020-12-23 03:40:09,674 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:09,675 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:09,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 03:40:09,675 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:09,676 INFO L82 PathProgramCache]: Analyzing trace with hash -890036000, now seen corresponding path program 1 times [2020-12-23 03:40:09,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:09,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86544050] [2020-12-23 03:40:09,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-23 03:40:09,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86544050] [2020-12-23 03:40:09,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:09,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:09,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672091056] [2020-12-23 03:40:09,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:09,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:09,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:09,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:09,860 INFO L87 Difference]: Start difference. First operand 2664 states and 3289 transitions. Second operand 3 states. [2020-12-23 03:40:10,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:10,929 INFO L93 Difference]: Finished difference Result 6247 states and 7900 transitions. [2020-12-23 03:40:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:10,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2020-12-23 03:40:10,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:10,951 INFO L225 Difference]: With dead ends: 6247 [2020-12-23 03:40:10,952 INFO L226 Difference]: Without dead ends: 3769 [2020-12-23 03:40:10,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2020-12-23 03:40:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 3769. [2020-12-23 03:40:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3769 states. [2020-12-23 03:40:11,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 4585 transitions. [2020-12-23 03:40:11,032 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 4585 transitions. Word has length 221 [2020-12-23 03:40:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:11,033 INFO L481 AbstractCegarLoop]: Abstraction has 3769 states and 4585 transitions. [2020-12-23 03:40:11,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 4585 transitions. [2020-12-23 03:40:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-12-23 03:40:11,037 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:11,037 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:11,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 03:40:11,038 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:11,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:11,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1786639215, now seen corresponding path program 1 times [2020-12-23 03:40:11,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:11,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000393650] [2020-12-23 03:40:11,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 03:40:11,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000393650] [2020-12-23 03:40:11,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:11,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:11,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493098735] [2020-12-23 03:40:11,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:11,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:11,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:11,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:11,230 INFO L87 Difference]: Start difference. First operand 3769 states and 4585 transitions. Second operand 3 states. [2020-12-23 03:40:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:12,419 INFO L93 Difference]: Finished difference Result 8835 states and 10879 transitions. [2020-12-23 03:40:12,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:12,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2020-12-23 03:40:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:12,445 INFO L225 Difference]: With dead ends: 8835 [2020-12-23 03:40:12,445 INFO L226 Difference]: Without dead ends: 5252 [2020-12-23 03:40:12,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2020-12-23 03:40:12,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 5242. [2020-12-23 03:40:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5242 states. [2020-12-23 03:40:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 6267 transitions. [2020-12-23 03:40:12,555 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 6267 transitions. Word has length 227 [2020-12-23 03:40:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:12,556 INFO L481 AbstractCegarLoop]: Abstraction has 5242 states and 6267 transitions. [2020-12-23 03:40:12,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 6267 transitions. [2020-12-23 03:40:12,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2020-12-23 03:40:12,564 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:12,564 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:12,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 03:40:12,565 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:12,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:12,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1830859079, now seen corresponding path program 1 times [2020-12-23 03:40:12,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:12,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739352303] [2020-12-23 03:40:12,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2020-12-23 03:40:12,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739352303] [2020-12-23 03:40:12,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:12,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:12,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804417514] [2020-12-23 03:40:12,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:12,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:12,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:12,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:12,785 INFO L87 Difference]: Start difference. First operand 5242 states and 6267 transitions. Second operand 3 states. [2020-12-23 03:40:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:13,828 INFO L93 Difference]: Finished difference Result 11789 states and 14291 transitions. [2020-12-23 03:40:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:13,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2020-12-23 03:40:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:13,860 INFO L225 Difference]: With dead ends: 11789 [2020-12-23 03:40:13,860 INFO L226 Difference]: Without dead ends: 6733 [2020-12-23 03:40:13,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2020-12-23 03:40:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 6347. [2020-12-23 03:40:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6347 states. [2020-12-23 03:40:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6347 states to 6347 states and 7558 transitions. [2020-12-23 03:40:13,992 INFO L78 Accepts]: Start accepts. Automaton has 6347 states and 7558 transitions. Word has length 298 [2020-12-23 03:40:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:13,993 INFO L481 AbstractCegarLoop]: Abstraction has 6347 states and 7558 transitions. [2020-12-23 03:40:13,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 6347 states and 7558 transitions. [2020-12-23 03:40:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2020-12-23 03:40:14,001 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:14,002 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 03:40:14,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 03:40:14,002 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:14,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:14,003 INFO L82 PathProgramCache]: Analyzing trace with hash 719890930, now seen corresponding path program 1 times [2020-12-23 03:40:14,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:14,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317722274] [2020-12-23 03:40:14,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-23 03:40:14,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317722274] [2020-12-23 03:40:14,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:14,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:14,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011393019] [2020-12-23 03:40:14,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:14,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:14,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:14,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:14,264 INFO L87 Difference]: Start difference. First operand 6347 states and 7558 transitions. Second operand 3 states. [2020-12-23 03:40:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:15,147 INFO L93 Difference]: Finished difference Result 12293 states and 14630 transitions. [2020-12-23 03:40:15,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:15,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2020-12-23 03:40:15,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:15,174 INFO L225 Difference]: With dead ends: 12293 [2020-12-23 03:40:15,174 INFO L226 Difference]: Without dead ends: 5948 [2020-12-23 03:40:15,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-12-23 03:40:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 5946. [2020-12-23 03:40:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5946 states. [2020-12-23 03:40:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5946 states to 5946 states and 6776 transitions. [2020-12-23 03:40:15,287 INFO L78 Accepts]: Start accepts. Automaton has 5946 states and 6776 transitions. Word has length 301 [2020-12-23 03:40:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:15,288 INFO L481 AbstractCegarLoop]: Abstraction has 5946 states and 6776 transitions. [2020-12-23 03:40:15,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5946 states and 6776 transitions. [2020-12-23 03:40:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2020-12-23 03:40:15,301 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:15,301 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:15,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 03:40:15,302 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:15,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:15,303 INFO L82 PathProgramCache]: Analyzing trace with hash 142462327, now seen corresponding path program 1 times [2020-12-23 03:40:15,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:15,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844055532] [2020-12-23 03:40:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-12-23 03:40:15,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844055532] [2020-12-23 03:40:15,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:15,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:40:15,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702288377] [2020-12-23 03:40:15,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:15,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:15,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:15,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:15,720 INFO L87 Difference]: Start difference. First operand 5946 states and 6776 transitions. Second operand 3 states. [2020-12-23 03:40:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:16,297 INFO L93 Difference]: Finished difference Result 11886 states and 13546 transitions. [2020-12-23 03:40:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:16,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 379 [2020-12-23 03:40:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:16,344 INFO L225 Difference]: With dead ends: 11886 [2020-12-23 03:40:16,344 INFO L226 Difference]: Without dead ends: 5942 [2020-12-23 03:40:16,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2020-12-23 03:40:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 5942. [2020-12-23 03:40:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5942 states. [2020-12-23 03:40:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5942 states to 5942 states and 6768 transitions. [2020-12-23 03:40:16,443 INFO L78 Accepts]: Start accepts. Automaton has 5942 states and 6768 transitions. Word has length 379 [2020-12-23 03:40:16,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:16,444 INFO L481 AbstractCegarLoop]: Abstraction has 5942 states and 6768 transitions. [2020-12-23 03:40:16,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:16,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5942 states and 6768 transitions. [2020-12-23 03:40:16,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2020-12-23 03:40:16,459 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:16,459 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:16,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 03:40:16,460 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:16,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:16,460 INFO L82 PathProgramCache]: Analyzing trace with hash -180803510, now seen corresponding path program 1 times [2020-12-23 03:40:16,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:16,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831521454] [2020-12-23 03:40:16,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 03:40:16,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831521454] [2020-12-23 03:40:16,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:16,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:16,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581673677] [2020-12-23 03:40:16,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:16,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:16,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:16,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:16,860 INFO L87 Difference]: Start difference. First operand 5942 states and 6768 transitions. Second operand 3 states. [2020-12-23 03:40:17,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:17,826 INFO L93 Difference]: Finished difference Result 13368 states and 15226 transitions. [2020-12-23 03:40:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:17,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 411 [2020-12-23 03:40:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:17,845 INFO L225 Difference]: With dead ends: 13368 [2020-12-23 03:40:17,845 INFO L226 Difference]: Without dead ends: 7428 [2020-12-23 03:40:17,852 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7428 states. [2020-12-23 03:40:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7428 to 7230. [2020-12-23 03:40:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2020-12-23 03:40:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 8188 transitions. [2020-12-23 03:40:18,013 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 8188 transitions. Word has length 411 [2020-12-23 03:40:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:18,014 INFO L481 AbstractCegarLoop]: Abstraction has 7230 states and 8188 transitions. [2020-12-23 03:40:18,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 8188 transitions. [2020-12-23 03:40:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-12-23 03:40:18,035 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:18,036 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:18,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 03:40:18,036 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:18,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1611250862, now seen corresponding path program 1 times [2020-12-23 03:40:18,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:18,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718578096] [2020-12-23 03:40:18,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-12-23 03:40:18,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718578096] [2020-12-23 03:40:18,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:18,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:18,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939065804] [2020-12-23 03:40:18,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:18,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:18,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:18,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:18,551 INFO L87 Difference]: Start difference. First operand 7230 states and 8188 transitions. Second operand 3 states. [2020-12-23 03:40:19,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:19,732 INFO L93 Difference]: Finished difference Result 16665 states and 18923 transitions. [2020-12-23 03:40:19,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:19,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 463 [2020-12-23 03:40:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:19,748 INFO L225 Difference]: With dead ends: 16665 [2020-12-23 03:40:19,749 INFO L226 Difference]: Without dead ends: 8701 [2020-12-23 03:40:19,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:19,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8701 states. [2020-12-23 03:40:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8701 to 8701. [2020-12-23 03:40:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8701 states. [2020-12-23 03:40:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8701 states to 8701 states and 9814 transitions. [2020-12-23 03:40:19,883 INFO L78 Accepts]: Start accepts. Automaton has 8701 states and 9814 transitions. Word has length 463 [2020-12-23 03:40:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:19,884 INFO L481 AbstractCegarLoop]: Abstraction has 8701 states and 9814 transitions. [2020-12-23 03:40:19,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 8701 states and 9814 transitions. [2020-12-23 03:40:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2020-12-23 03:40:19,910 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:19,910 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:19,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 03:40:19,911 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:19,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:19,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2033522650, now seen corresponding path program 1 times [2020-12-23 03:40:19,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:19,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978945246] [2020-12-23 03:40:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2020-12-23 03:40:20,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978945246] [2020-12-23 03:40:20,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:20,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:20,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836893548] [2020-12-23 03:40:20,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:20,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:20,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:20,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:20,310 INFO L87 Difference]: Start difference. First operand 8701 states and 9814 transitions. Second operand 3 states. [2020-12-23 03:40:21,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:21,435 INFO L93 Difference]: Finished difference Result 19808 states and 22411 transitions. [2020-12-23 03:40:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:21,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2020-12-23 03:40:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:21,459 INFO L225 Difference]: With dead ends: 19808 [2020-12-23 03:40:21,459 INFO L226 Difference]: Without dead ends: 11109 [2020-12-23 03:40:21,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11109 states. [2020-12-23 03:40:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11109 to 10921. [2020-12-23 03:40:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10921 states. [2020-12-23 03:40:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10921 states to 10921 states and 12249 transitions. [2020-12-23 03:40:21,647 INFO L78 Accepts]: Start accepts. Automaton has 10921 states and 12249 transitions. Word has length 499 [2020-12-23 03:40:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:21,648 INFO L481 AbstractCegarLoop]: Abstraction has 10921 states and 12249 transitions. [2020-12-23 03:40:21,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 10921 states and 12249 transitions. [2020-12-23 03:40:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2020-12-23 03:40:21,671 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:21,671 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:21,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 03:40:21,672 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:21,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:21,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1343348106, now seen corresponding path program 1 times [2020-12-23 03:40:21,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:21,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746967335] [2020-12-23 03:40:21,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2020-12-23 03:40:22,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746967335] [2020-12-23 03:40:22,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:22,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:22,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583355509] [2020-12-23 03:40:22,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:22,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:22,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:22,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:22,083 INFO L87 Difference]: Start difference. First operand 10921 states and 12249 transitions. Second operand 3 states. [2020-12-23 03:40:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:23,281 INFO L93 Difference]: Finished difference Result 25155 states and 28230 transitions. [2020-12-23 03:40:23,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:23,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 503 [2020-12-23 03:40:23,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:23,308 INFO L225 Difference]: With dead ends: 25155 [2020-12-23 03:40:23,308 INFO L226 Difference]: Without dead ends: 14236 [2020-12-23 03:40:23,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14236 states. [2020-12-23 03:40:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14236 to 13489. [2020-12-23 03:40:23,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13489 states. [2020-12-23 03:40:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13489 states to 13489 states and 15044 transitions. [2020-12-23 03:40:23,573 INFO L78 Accepts]: Start accepts. Automaton has 13489 states and 15044 transitions. Word has length 503 [2020-12-23 03:40:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:23,574 INFO L481 AbstractCegarLoop]: Abstraction has 13489 states and 15044 transitions. [2020-12-23 03:40:23,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 13489 states and 15044 transitions. [2020-12-23 03:40:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2020-12-23 03:40:23,606 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:23,606 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:23,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 03:40:23,607 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:23,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:23,608 INFO L82 PathProgramCache]: Analyzing trace with hash 101919231, now seen corresponding path program 1 times [2020-12-23 03:40:23,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:23,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130058207] [2020-12-23 03:40:23,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 228 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2020-12-23 03:40:24,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130058207] [2020-12-23 03:40:24,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355405072] [2020-12-23 03:40:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:40:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:24,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 03:40:24,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:40:24,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 03:40:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-12-23 03:40:25,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 03:40:25,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2020-12-23 03:40:25,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791519985] [2020-12-23 03:40:25,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:40:25,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:25,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:40:25,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-23 03:40:25,558 INFO L87 Difference]: Start difference. First operand 13489 states and 15044 transitions. Second operand 4 states. [2020-12-23 03:40:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:27,400 INFO L93 Difference]: Finished difference Result 37121 states and 41218 transitions. [2020-12-23 03:40:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:40:27,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 509 [2020-12-23 03:40:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:27,451 INFO L225 Difference]: With dead ends: 37121 [2020-12-23 03:40:27,451 INFO L226 Difference]: Without dead ends: 23082 [2020-12-23 03:40:27,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-23 03:40:27,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23082 states. [2020-12-23 03:40:27,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23082 to 19941. [2020-12-23 03:40:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19941 states. [2020-12-23 03:40:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19941 states to 19941 states and 22006 transitions. [2020-12-23 03:40:27,963 INFO L78 Accepts]: Start accepts. Automaton has 19941 states and 22006 transitions. Word has length 509 [2020-12-23 03:40:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:27,964 INFO L481 AbstractCegarLoop]: Abstraction has 19941 states and 22006 transitions. [2020-12-23 03:40:27,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:40:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 19941 states and 22006 transitions. [2020-12-23 03:40:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2020-12-23 03:40:28,015 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:28,016 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:28,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 03:40:28,230 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:28,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:28,232 INFO L82 PathProgramCache]: Analyzing trace with hash 39308115, now seen corresponding path program 1 times [2020-12-23 03:40:28,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:28,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680928965] [2020-12-23 03:40:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2020-12-23 03:40:28,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680928965] [2020-12-23 03:40:28,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:28,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:28,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459460031] [2020-12-23 03:40:28,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:28,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:28,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:28,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:28,866 INFO L87 Difference]: Start difference. First operand 19941 states and 22006 transitions. Second operand 3 states. [2020-12-23 03:40:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:30,138 INFO L93 Difference]: Finished difference Result 38972 states and 43067 transitions. [2020-12-23 03:40:30,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:30,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 605 [2020-12-23 03:40:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:30,179 INFO L225 Difference]: With dead ends: 38972 [2020-12-23 03:40:30,180 INFO L226 Difference]: Without dead ends: 21613 [2020-12-23 03:40:30,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2020-12-23 03:40:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 19573. [2020-12-23 03:40:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19573 states. [2020-12-23 03:40:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19573 states to 19573 states and 21591 transitions. [2020-12-23 03:40:30,614 INFO L78 Accepts]: Start accepts. Automaton has 19573 states and 21591 transitions. Word has length 605 [2020-12-23 03:40:30,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:30,615 INFO L481 AbstractCegarLoop]: Abstraction has 19573 states and 21591 transitions. [2020-12-23 03:40:30,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:30,615 INFO L276 IsEmpty]: Start isEmpty. Operand 19573 states and 21591 transitions. [2020-12-23 03:40:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2020-12-23 03:40:30,645 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:30,646 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:30,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 03:40:30,646 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:30,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:30,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2090442296, now seen corresponding path program 1 times [2020-12-23 03:40:30,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:30,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261534980] [2020-12-23 03:40:30,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 527 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2020-12-23 03:40:31,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261534980] [2020-12-23 03:40:31,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:31,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:31,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379798410] [2020-12-23 03:40:31,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:31,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:31,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:31,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:31,393 INFO L87 Difference]: Start difference. First operand 19573 states and 21591 transitions. Second operand 3 states. [2020-12-23 03:40:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:32,403 INFO L93 Difference]: Finished difference Result 39879 states and 43994 transitions. [2020-12-23 03:40:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:32,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 626 [2020-12-23 03:40:32,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:32,437 INFO L225 Difference]: With dead ends: 39879 [2020-12-23 03:40:32,438 INFO L226 Difference]: Without dead ends: 20676 [2020-12-23 03:40:32,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20676 states. [2020-12-23 03:40:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20676 to 19011. [2020-12-23 03:40:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19011 states. [2020-12-23 03:40:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19011 states to 19011 states and 20888 transitions. [2020-12-23 03:40:32,790 INFO L78 Accepts]: Start accepts. Automaton has 19011 states and 20888 transitions. Word has length 626 [2020-12-23 03:40:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:32,791 INFO L481 AbstractCegarLoop]: Abstraction has 19011 states and 20888 transitions. [2020-12-23 03:40:32,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 19011 states and 20888 transitions. [2020-12-23 03:40:32,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2020-12-23 03:40:32,828 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:32,828 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:32,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 03:40:32,829 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:32,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:32,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1498902212, now seen corresponding path program 1 times [2020-12-23 03:40:32,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:32,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342615703] [2020-12-23 03:40:32,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 1056 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2020-12-23 03:40:33,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342615703] [2020-12-23 03:40:33,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:33,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 03:40:33,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249434651] [2020-12-23 03:40:33,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:40:33,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:33,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:40:33,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:40:33,634 INFO L87 Difference]: Start difference. First operand 19011 states and 20888 transitions. Second operand 4 states. [2020-12-23 03:40:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:35,587 INFO L93 Difference]: Finished difference Result 41713 states and 45965 transitions. [2020-12-23 03:40:35,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:40:35,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 637 [2020-12-23 03:40:35,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:35,617 INFO L225 Difference]: With dead ends: 41713 [2020-12-23 03:40:35,618 INFO L226 Difference]: Without dead ends: 25468 [2020-12-23 03:40:35,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:40:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25468 states. [2020-12-23 03:40:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25468 to 20489. [2020-12-23 03:40:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20489 states. [2020-12-23 03:40:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20489 states to 20489 states and 22604 transitions. [2020-12-23 03:40:35,944 INFO L78 Accepts]: Start accepts. Automaton has 20489 states and 22604 transitions. Word has length 637 [2020-12-23 03:40:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:35,944 INFO L481 AbstractCegarLoop]: Abstraction has 20489 states and 22604 transitions. [2020-12-23 03:40:35,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:40:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 20489 states and 22604 transitions. [2020-12-23 03:40:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2020-12-23 03:40:35,968 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:35,968 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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] [2020-12-23 03:40:35,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 03:40:35,969 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:35,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:35,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1270700194, now seen corresponding path program 1 times [2020-12-23 03:40:35,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:35,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573386986] [2020-12-23 03:40:35,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 833 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-12-23 03:40:37,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573386986] [2020-12-23 03:40:37,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:37,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 03:40:37,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496421200] [2020-12-23 03:40:37,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 03:40:37,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:37,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 03:40:37,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 03:40:37,386 INFO L87 Difference]: Start difference. First operand 20489 states and 22604 transitions. Second operand 6 states. [2020-12-23 03:40:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:39,455 INFO L93 Difference]: Finished difference Result 43526 states and 47967 transitions. [2020-12-23 03:40:39,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 03:40:39,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 660 [2020-12-23 03:40:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:39,483 INFO L225 Difference]: With dead ends: 43526 [2020-12-23 03:40:39,484 INFO L226 Difference]: Without dead ends: 23407 [2020-12-23 03:40:39,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-12-23 03:40:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23407 states. [2020-12-23 03:40:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23407 to 23066. [2020-12-23 03:40:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23066 states. [2020-12-23 03:40:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23066 states to 23066 states and 25391 transitions. [2020-12-23 03:40:39,917 INFO L78 Accepts]: Start accepts. Automaton has 23066 states and 25391 transitions. Word has length 660 [2020-12-23 03:40:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:39,918 INFO L481 AbstractCegarLoop]: Abstraction has 23066 states and 25391 transitions. [2020-12-23 03:40:39,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 03:40:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 23066 states and 25391 transitions. [2020-12-23 03:40:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2020-12-23 03:40:39,945 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:39,945 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2020-12-23 03:40:39,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 03:40:39,946 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:39,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:39,946 INFO L82 PathProgramCache]: Analyzing trace with hash -640133979, now seen corresponding path program 1 times [2020-12-23 03:40:39,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:39,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719106269] [2020-12-23 03:40:39,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 855 proven. 8 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-12-23 03:40:41,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719106269] [2020-12-23 03:40:41,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575164099] [2020-12-23 03:40:41,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:40:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:41,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 03:40:41,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:40:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 742 proven. 121 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-12-23 03:40:42,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 03:40:42,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2020-12-23 03:40:42,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252129734] [2020-12-23 03:40:42,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 03:40:42,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:42,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 03:40:42,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-23 03:40:42,735 INFO L87 Difference]: Start difference. First operand 23066 states and 25391 transitions. Second operand 9 states. [2020-12-23 03:40:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:47,668 INFO L93 Difference]: Finished difference Result 48878 states and 53776 transitions. [2020-12-23 03:40:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 03:40:47,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 670 [2020-12-23 03:40:47,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:47,694 INFO L225 Difference]: With dead ends: 48878 [2020-12-23 03:40:47,694 INFO L226 Difference]: Without dead ends: 26182 [2020-12-23 03:40:47,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2020-12-23 03:40:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26182 states. [2020-12-23 03:40:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26182 to 20670. [2020-12-23 03:40:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20670 states. [2020-12-23 03:40:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20670 states to 20670 states and 22740 transitions. [2020-12-23 03:40:48,004 INFO L78 Accepts]: Start accepts. Automaton has 20670 states and 22740 transitions. Word has length 670 [2020-12-23 03:40:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:48,004 INFO L481 AbstractCegarLoop]: Abstraction has 20670 states and 22740 transitions. [2020-12-23 03:40:48,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 03:40:48,005 INFO L276 IsEmpty]: Start isEmpty. Operand 20670 states and 22740 transitions. [2020-12-23 03:40:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2020-12-23 03:40:48,028 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:48,029 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:48,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:40:48,243 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:48,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:48,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2139535083, now seen corresponding path program 1 times [2020-12-23 03:40:48,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:48,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805201395] [2020-12-23 03:40:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 909 proven. 213 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2020-12-23 03:40:49,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805201395] [2020-12-23 03:40:49,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580388197] [2020-12-23 03:40:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:40:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:49,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 03:40:49,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:40:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 872 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-12-23 03:40:50,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 03:40:50,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 03:40:50,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362602570] [2020-12-23 03:40:50,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:50,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:50,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:50,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 03:40:50,276 INFO L87 Difference]: Start difference. First operand 20670 states and 22740 transitions. Second operand 3 states. [2020-12-23 03:40:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:51,353 INFO L93 Difference]: Finished difference Result 40061 states and 44158 transitions. [2020-12-23 03:40:51,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:51,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 675 [2020-12-23 03:40:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:51,377 INFO L225 Difference]: With dead ends: 40061 [2020-12-23 03:40:51,377 INFO L226 Difference]: Without dead ends: 22155 [2020-12-23 03:40:51,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 676 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 03:40:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22155 states. [2020-12-23 03:40:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22155 to 21960. [2020-12-23 03:40:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21960 states. [2020-12-23 03:40:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21960 states to 21960 states and 24118 transitions. [2020-12-23 03:40:51,600 INFO L78 Accepts]: Start accepts. Automaton has 21960 states and 24118 transitions. Word has length 675 [2020-12-23 03:40:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:51,600 INFO L481 AbstractCegarLoop]: Abstraction has 21960 states and 24118 transitions. [2020-12-23 03:40:51,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 21960 states and 24118 transitions. [2020-12-23 03:40:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2020-12-23 03:40:51,633 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:51,634 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:51,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:40:51,847 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:51,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:51,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1065570907, now seen corresponding path program 1 times [2020-12-23 03:40:51,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:51,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694015651] [2020-12-23 03:40:51,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 1033 proven. 64 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2020-12-23 03:40:53,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694015651] [2020-12-23 03:40:53,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588443638] [2020-12-23 03:40:53,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:40:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:53,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 03:40:53,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:40:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 1097 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2020-12-23 03:40:54,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 03:40:54,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-12-23 03:40:54,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086012714] [2020-12-23 03:40:54,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:54,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:54,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:54,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 03:40:54,031 INFO L87 Difference]: Start difference. First operand 21960 states and 24118 transitions. Second operand 3 states. [2020-12-23 03:40:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:55,109 INFO L93 Difference]: Finished difference Result 42087 states and 46247 transitions. [2020-12-23 03:40:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:55,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 685 [2020-12-23 03:40:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:55,139 INFO L225 Difference]: With dead ends: 42087 [2020-12-23 03:40:55,139 INFO L226 Difference]: Without dead ends: 22707 [2020-12-23 03:40:55,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 03:40:55,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22707 states. [2020-12-23 03:40:55,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22707 to 21592. [2020-12-23 03:40:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21592 states. [2020-12-23 03:40:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21592 states to 21592 states and 23657 transitions. [2020-12-23 03:40:55,359 INFO L78 Accepts]: Start accepts. Automaton has 21592 states and 23657 transitions. Word has length 685 [2020-12-23 03:40:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:55,360 INFO L481 AbstractCegarLoop]: Abstraction has 21592 states and 23657 transitions. [2020-12-23 03:40:55,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 21592 states and 23657 transitions. [2020-12-23 03:40:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2020-12-23 03:40:55,374 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:55,374 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:55,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:40:55,583 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:55,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:55,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1737940617, now seen corresponding path program 1 times [2020-12-23 03:40:55,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:55,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354881968] [2020-12-23 03:40:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 904 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-12-23 03:40:56,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354881968] [2020-12-23 03:40:56,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:56,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:56,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557962096] [2020-12-23 03:40:56,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:40:56,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:56,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:40:56,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:40:56,385 INFO L87 Difference]: Start difference. First operand 21592 states and 23657 transitions. Second operand 4 states. [2020-12-23 03:40:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:58,001 INFO L93 Difference]: Finished difference Result 40791 states and 44731 transitions. [2020-12-23 03:40:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:40:58,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 691 [2020-12-23 03:40:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:58,028 INFO L225 Difference]: With dead ends: 40791 [2020-12-23 03:40:58,028 INFO L226 Difference]: Without dead ends: 21963 [2020-12-23 03:40:58,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:40:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21963 states. [2020-12-23 03:40:58,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21963 to 21040. [2020-12-23 03:40:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21040 states. [2020-12-23 03:40:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21040 states to 21040 states and 23058 transitions. [2020-12-23 03:40:58,248 INFO L78 Accepts]: Start accepts. Automaton has 21040 states and 23058 transitions. Word has length 691 [2020-12-23 03:40:58,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:58,248 INFO L481 AbstractCegarLoop]: Abstraction has 21040 states and 23058 transitions. [2020-12-23 03:40:58,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:40:58,248 INFO L276 IsEmpty]: Start isEmpty. Operand 21040 states and 23058 transitions. [2020-12-23 03:40:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2020-12-23 03:40:58,263 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:58,264 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:58,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 03:40:58,265 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:58,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:58,265 INFO L82 PathProgramCache]: Analyzing trace with hash 607261995, now seen corresponding path program 1 times [2020-12-23 03:40:58,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:58,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516858828] [2020-12-23 03:40:58,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1644 backedges. 1184 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2020-12-23 03:40:58,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516858828] [2020-12-23 03:40:58,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:58,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:58,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315684379] [2020-12-23 03:40:58,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:58,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:58,910 INFO L87 Difference]: Start difference. First operand 21040 states and 23058 transitions. Second operand 3 states. [2020-12-23 03:41:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:00,027 INFO L93 Difference]: Finished difference Result 40429 states and 44363 transitions. [2020-12-23 03:41:00,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:41:00,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 714 [2020-12-23 03:41:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:00,046 INFO L225 Difference]: With dead ends: 40429 [2020-12-23 03:41:00,046 INFO L226 Difference]: Without dead ends: 21969 [2020-12-23 03:41:00,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:41:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21969 states. [2020-12-23 03:41:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21969 to 21040. [2020-12-23 03:41:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21040 states. [2020-12-23 03:41:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21040 states to 21040 states and 23058 transitions. [2020-12-23 03:41:00,254 INFO L78 Accepts]: Start accepts. Automaton has 21040 states and 23058 transitions. Word has length 714 [2020-12-23 03:41:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:00,254 INFO L481 AbstractCegarLoop]: Abstraction has 21040 states and 23058 transitions. [2020-12-23 03:41:00,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:41:00,254 INFO L276 IsEmpty]: Start isEmpty. Operand 21040 states and 23058 transitions. [2020-12-23 03:41:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2020-12-23 03:41:00,268 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:00,269 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:41:00,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 03:41:00,269 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:00,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:00,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1842385671, now seen corresponding path program 1 times [2020-12-23 03:41:00,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:00,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390745567] [2020-12-23 03:41:00,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1675 backedges. 1031 proven. 0 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2020-12-23 03:41:01,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390745567] [2020-12-23 03:41:01,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:41:01,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 03:41:01,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143104683] [2020-12-23 03:41:01,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:41:01,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:01,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:41:01,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:41:01,129 INFO L87 Difference]: Start difference. First operand 21040 states and 23058 transitions. Second operand 4 states. [2020-12-23 03:41:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:03,100 INFO L93 Difference]: Finished difference Result 47791 states and 52394 transitions. [2020-12-23 03:41:03,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:41:03,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 740 [2020-12-23 03:41:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:03,126 INFO L225 Difference]: With dead ends: 47791 [2020-12-23 03:41:03,126 INFO L226 Difference]: Without dead ends: 27121 [2020-12-23 03:41:03,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:41:03,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27121 states. [2020-12-23 03:41:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27121 to 25090. [2020-12-23 03:41:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25090 states. [2020-12-23 03:41:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25090 states to 25090 states and 27313 transitions. [2020-12-23 03:41:03,391 INFO L78 Accepts]: Start accepts. Automaton has 25090 states and 27313 transitions. Word has length 740 [2020-12-23 03:41:03,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:03,392 INFO L481 AbstractCegarLoop]: Abstraction has 25090 states and 27313 transitions. [2020-12-23 03:41:03,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:41:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 25090 states and 27313 transitions. [2020-12-23 03:41:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2020-12-23 03:41:03,410 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:03,410 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:41:03,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 03:41:03,411 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:03,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:03,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1455269364, now seen corresponding path program 1 times [2020-12-23 03:41:03,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:03,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345014319] [2020-12-23 03:41:03,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 1099 proven. 0 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2020-12-23 03:41:04,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345014319] [2020-12-23 03:41:04,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:41:04,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:41:04,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699049177] [2020-12-23 03:41:04,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:41:04,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:04,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:41:04,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:41:04,140 INFO L87 Difference]: Start difference. First operand 25090 states and 27313 transitions. Second operand 3 states. [2020-12-23 03:41:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:04,787 INFO L93 Difference]: Finished difference Result 47601 states and 51903 transitions. [2020-12-23 03:41:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:41:04,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 878 [2020-12-23 03:41:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:04,811 INFO L225 Difference]: With dead ends: 47601 [2020-12-23 03:41:04,811 INFO L226 Difference]: Without dead ends: 25089 [2020-12-23 03:41:04,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:41:04,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25089 states. [2020-12-23 03:41:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25089 to 25089. [2020-12-23 03:41:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25089 states. [2020-12-23 03:41:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25089 states to 25089 states and 27310 transitions. [2020-12-23 03:41:05,071 INFO L78 Accepts]: Start accepts. Automaton has 25089 states and 27310 transitions. Word has length 878 [2020-12-23 03:41:05,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:05,071 INFO L481 AbstractCegarLoop]: Abstraction has 25089 states and 27310 transitions. [2020-12-23 03:41:05,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:41:05,072 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states and 27310 transitions. [2020-12-23 03:41:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 895 [2020-12-23 03:41:05,090 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:05,090 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:41:05,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 03:41:05,091 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:05,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:05,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1163022730, now seen corresponding path program 1 times [2020-12-23 03:41:05,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:05,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904140889] [2020-12-23 03:41:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 1517 proven. 0 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2020-12-23 03:41:06,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904140889] [2020-12-23 03:41:06,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:41:06,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:41:06,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286644267] [2020-12-23 03:41:06,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:41:06,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:06,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:41:06,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:41:06,053 INFO L87 Difference]: Start difference. First operand 25089 states and 27310 transitions. Second operand 3 states. [2020-12-23 03:41:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:07,256 INFO L93 Difference]: Finished difference Result 48337 states and 52695 transitions. [2020-12-23 03:41:07,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:41:07,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 894 [2020-12-23 03:41:07,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:07,280 INFO L225 Difference]: With dead ends: 48337 [2020-12-23 03:41:07,280 INFO L226 Difference]: Without dead ends: 25826 [2020-12-23 03:41:07,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:41:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25826 states. [2020-12-23 03:41:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25826 to 23983. [2020-12-23 03:41:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23983 states. [2020-12-23 03:41:07,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23983 states to 23983 states and 26105 transitions. [2020-12-23 03:41:07,679 INFO L78 Accepts]: Start accepts. Automaton has 23983 states and 26105 transitions. Word has length 894 [2020-12-23 03:41:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:07,680 INFO L481 AbstractCegarLoop]: Abstraction has 23983 states and 26105 transitions. [2020-12-23 03:41:07,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:41:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 23983 states and 26105 transitions. [2020-12-23 03:41:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2020-12-23 03:41:07,697 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:07,698 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:41:07,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 03:41:07,698 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:07,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:07,699 INFO L82 PathProgramCache]: Analyzing trace with hash -583119657, now seen corresponding path program 1 times [2020-12-23 03:41:07,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:07,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627325921] [2020-12-23 03:41:07,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1495 proven. 0 refuted. 0 times theorem prover too weak. 1403 trivial. 0 not checked. [2020-12-23 03:41:08,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627325921] [2020-12-23 03:41:08,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:41:08,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:41:08,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652363228] [2020-12-23 03:41:08,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:41:08,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:08,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:41:08,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:41:08,609 INFO L87 Difference]: Start difference. First operand 23983 states and 26105 transitions. Second operand 3 states. [2020-12-23 03:41:09,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:09,877 INFO L93 Difference]: Finished difference Result 45939 states and 49939 transitions. [2020-12-23 03:41:09,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:41:09,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 939 [2020-12-23 03:41:09,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:09,897 INFO L225 Difference]: With dead ends: 45939 [2020-12-23 03:41:09,898 INFO L226 Difference]: Without dead ends: 23428 [2020-12-23 03:41:09,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:41:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23428 states. [2020-12-23 03:41:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23428 to 21953. [2020-12-23 03:41:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21953 states. [2020-12-23 03:41:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21953 states to 21953 states and 23580 transitions. [2020-12-23 03:41:10,135 INFO L78 Accepts]: Start accepts. Automaton has 21953 states and 23580 transitions. Word has length 939 [2020-12-23 03:41:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:10,135 INFO L481 AbstractCegarLoop]: Abstraction has 21953 states and 23580 transitions. [2020-12-23 03:41:10,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:41:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 21953 states and 23580 transitions. [2020-12-23 03:41:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2020-12-23 03:41:10,153 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:10,154 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2020-12-23 03:41:10,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 03:41:10,154 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:10,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:10,155 INFO L82 PathProgramCache]: Analyzing trace with hash 178991157, now seen corresponding path program 1 times [2020-12-23 03:41:10,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:10,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952004678] [2020-12-23 03:41:10,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2815 backedges. 1420 proven. 0 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2020-12-23 03:41:11,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952004678] [2020-12-23 03:41:11,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:41:11,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:41:11,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402064029] [2020-12-23 03:41:11,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:41:11,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:11,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:41:11,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:41:11,226 INFO L87 Difference]: Start difference. First operand 21953 states and 23580 transitions. Second operand 3 states. [2020-12-23 03:41:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:11,870 INFO L93 Difference]: Finished difference Result 41325 states and 44435 transitions. [2020-12-23 03:41:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:41:11,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 967 [2020-12-23 03:41:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:11,890 INFO L225 Difference]: With dead ends: 41325 [2020-12-23 03:41:11,890 INFO L226 Difference]: Without dead ends: 21582 [2020-12-23 03:41:11,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:41:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21582 states. [2020-12-23 03:41:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21582 to 21580. [2020-12-23 03:41:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21580 states. [2020-12-23 03:41:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21580 states to 21580 states and 23170 transitions. [2020-12-23 03:41:12,098 INFO L78 Accepts]: Start accepts. Automaton has 21580 states and 23170 transitions. Word has length 967 [2020-12-23 03:41:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:12,099 INFO L481 AbstractCegarLoop]: Abstraction has 21580 states and 23170 transitions. [2020-12-23 03:41:12,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:41:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 21580 states and 23170 transitions. [2020-12-23 03:41:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2020-12-23 03:41:12,117 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:12,118 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 03:41:12,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 03:41:12,118 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:12,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:12,119 INFO L82 PathProgramCache]: Analyzing trace with hash 163973936, now seen corresponding path program 1 times [2020-12-23 03:41:12,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:12,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481366411] [2020-12-23 03:41:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3776 backedges. 2319 proven. 0 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2020-12-23 03:41:13,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481366411] [2020-12-23 03:41:13,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:41:13,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 03:41:13,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061780346] [2020-12-23 03:41:13,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:41:13,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:13,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:41:13,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:41:13,357 INFO L87 Difference]: Start difference. First operand 21580 states and 23170 transitions. Second operand 4 states. [2020-12-23 03:41:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:15,216 INFO L93 Difference]: Finished difference Result 43708 states and 46894 transitions. [2020-12-23 03:41:15,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:41:15,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1050 [2020-12-23 03:41:15,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:15,239 INFO L225 Difference]: With dead ends: 43708 [2020-12-23 03:41:15,239 INFO L226 Difference]: Without dead ends: 24338 [2020-12-23 03:41:15,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:41:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24338 states. [2020-12-23 03:41:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24338 to 18810. [2020-12-23 03:41:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18810 states. [2020-12-23 03:41:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18810 states to 18810 states and 20100 transitions. [2020-12-23 03:41:15,590 INFO L78 Accepts]: Start accepts. Automaton has 18810 states and 20100 transitions. Word has length 1050 [2020-12-23 03:41:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:15,590 INFO L481 AbstractCegarLoop]: Abstraction has 18810 states and 20100 transitions. [2020-12-23 03:41:15,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:41:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 18810 states and 20100 transitions. [2020-12-23 03:41:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1099 [2020-12-23 03:41:15,616 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:15,617 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:41:15,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 03:41:15,617 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:15,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash 780857241, now seen corresponding path program 1 times [2020-12-23 03:41:15,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:15,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681445566] [2020-12-23 03:41:15,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4045 backedges. 2474 proven. 0 refuted. 0 times theorem prover too weak. 1571 trivial. 0 not checked. [2020-12-23 03:41:16,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681445566] [2020-12-23 03:41:16,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:41:16,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:41:16,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730082110] [2020-12-23 03:41:16,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:41:16,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:16,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:41:16,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:41:16,702 INFO L87 Difference]: Start difference. First operand 18810 states and 20100 transitions. Second operand 3 states. [2020-12-23 03:41:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:17,833 INFO L93 Difference]: Finished difference Result 38170 states and 40771 transitions. [2020-12-23 03:41:17,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:41:17,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1098 [2020-12-23 03:41:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:17,852 INFO L225 Difference]: With dead ends: 38170 [2020-12-23 03:41:17,852 INFO L226 Difference]: Without dead ends: 19730 [2020-12-23 03:41:17,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:41:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19730 states. [2020-12-23 03:41:18,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19730 to 17706. [2020-12-23 03:41:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17706 states. [2020-12-23 03:41:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17706 states to 17706 states and 18849 transitions. [2020-12-23 03:41:18,037 INFO L78 Accepts]: Start accepts. Automaton has 17706 states and 18849 transitions. Word has length 1098 [2020-12-23 03:41:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:18,037 INFO L481 AbstractCegarLoop]: Abstraction has 17706 states and 18849 transitions. [2020-12-23 03:41:18,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:41:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 17706 states and 18849 transitions. [2020-12-23 03:41:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2020-12-23 03:41:18,056 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:18,057 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:41:18,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 03:41:18,057 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1329396945, now seen corresponding path program 1 times [2020-12-23 03:41:18,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:18,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600271213] [2020-12-23 03:41:18,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 2986 proven. 0 refuted. 0 times theorem prover too weak. 1121 trivial. 0 not checked. [2020-12-23 03:41:19,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600271213] [2020-12-23 03:41:19,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:41:19,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 03:41:19,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915516223] [2020-12-23 03:41:19,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:41:19,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:19,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:41:19,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:41:19,360 INFO L87 Difference]: Start difference. First operand 17706 states and 18849 transitions. Second operand 4 states. [2020-12-23 03:41:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:21,315 INFO L93 Difference]: Finished difference Result 39473 states and 42044 transitions. [2020-12-23 03:41:21,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:41:21,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1117 [2020-12-23 03:41:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:21,334 INFO L225 Difference]: With dead ends: 39473 [2020-12-23 03:41:21,334 INFO L226 Difference]: Without dead ends: 22873 [2020-12-23 03:41:21,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:41:21,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22873 states. [2020-12-23 03:41:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22873 to 16612. [2020-12-23 03:41:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16612 states. [2020-12-23 03:41:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16612 states to 16612 states and 17667 transitions. [2020-12-23 03:41:21,526 INFO L78 Accepts]: Start accepts. Automaton has 16612 states and 17667 transitions. Word has length 1117 [2020-12-23 03:41:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:21,527 INFO L481 AbstractCegarLoop]: Abstraction has 16612 states and 17667 transitions. [2020-12-23 03:41:21,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:41:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 16612 states and 17667 transitions. [2020-12-23 03:41:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1751 [2020-12-23 03:41:21,637 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:21,638 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 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, 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] [2020-12-23 03:41:21,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 03:41:21,638 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:21,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:21,639 INFO L82 PathProgramCache]: Analyzing trace with hash 91891771, now seen corresponding path program 1 times [2020-12-23 03:41:21,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:21,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378910354] [2020-12-23 03:41:21,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9263 backedges. 4979 proven. 277 refuted. 0 times theorem prover too weak. 4007 trivial. 0 not checked. [2020-12-23 03:41:26,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378910354] [2020-12-23 03:41:26,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887953306] [2020-12-23 03:41:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:41:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:26,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 2180 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-23 03:41:26,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:41:27,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 03:41:27,661 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 03:41:27,666 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 03:41:31,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9263 backedges. 5366 proven. 353 refuted. 0 times theorem prover too weak. 3544 trivial. 0 not checked. [2020-12-23 03:41:31,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 03:41:31,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 9 [2020-12-23 03:41:31,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407297587] [2020-12-23 03:41:31,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 03:41:31,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:31,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 03:41:31,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-12-23 03:41:31,901 INFO L87 Difference]: Start difference. First operand 16612 states and 17667 transitions. Second operand 10 states. [2020-12-23 03:41:37,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:37,583 INFO L93 Difference]: Finished difference Result 35729 states and 37964 transitions. [2020-12-23 03:41:37,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-23 03:41:37,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1750 [2020-12-23 03:41:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:37,600 INFO L225 Difference]: With dead ends: 35729 [2020-12-23 03:41:37,600 INFO L226 Difference]: Without dead ends: 18567 [2020-12-23 03:41:37,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1767 GetRequests, 1745 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2020-12-23 03:41:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18567 states. [2020-12-23 03:41:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18567 to 16612. [2020-12-23 03:41:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16612 states. [2020-12-23 03:41:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16612 states to 16612 states and 17570 transitions. [2020-12-23 03:41:37,821 INFO L78 Accepts]: Start accepts. Automaton has 16612 states and 17570 transitions. Word has length 1750 [2020-12-23 03:41:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:37,822 INFO L481 AbstractCegarLoop]: Abstraction has 16612 states and 17570 transitions. [2020-12-23 03:41:37,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 03:41:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 16612 states and 17570 transitions. [2020-12-23 03:41:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1864 [2020-12-23 03:41:37,850 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:37,850 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 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, 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] [2020-12-23 03:41:38,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-12-23 03:41:38,052 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:38,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash -450360572, now seen corresponding path program 1 times [2020-12-23 03:41:38,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:38,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238575974] [2020-12-23 03:41:38,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:43,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10677 backedges. 6358 proven. 312 refuted. 0 times theorem prover too weak. 4007 trivial. 0 not checked. [2020-12-23 03:41:43,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238575974] [2020-12-23 03:41:43,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998830759] [2020-12-23 03:41:43,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:41:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:43,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 2317 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 03:41:43,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:41:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10677 backedges. 6227 proven. 0 refuted. 0 times theorem prover too weak. 4450 trivial. 0 not checked. [2020-12-23 03:41:46,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 03:41:46,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2020-12-23 03:41:46,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594180686] [2020-12-23 03:41:46,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:41:46,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:46,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:41:46,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-23 03:41:46,666 INFO L87 Difference]: Start difference. First operand 16612 states and 17570 transitions. Second operand 4 states. [2020-12-23 03:41:48,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:48,117 INFO L93 Difference]: Finished difference Result 25656 states and 27084 transitions. [2020-12-23 03:41:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:41:48,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1863 [2020-12-23 03:41:48,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:48,120 INFO L225 Difference]: With dead ends: 25656 [2020-12-23 03:41:48,120 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 03:41:48,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1868 GetRequests, 1861 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-23 03:41:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 03:41:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 03:41:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 03:41:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 03:41:48,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1863 [2020-12-23 03:41:48,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:48,131 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 03:41:48,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:41:48,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 03:41:48,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 03:41:48,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:41:48,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 03:41:52,067 WARN L197 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 1202 DAG size of output: 712 [2020-12-23 03:41:55,030 WARN L197 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 1199 DAG size of output: 708 [2020-12-23 03:42:01,627 WARN L197 SmtUtils]: Spent 6.59 s on a formula simplification. DAG size of input: 627 DAG size of output: 148 [2020-12-23 03:42:08,192 WARN L197 SmtUtils]: Spent 6.56 s on a formula simplification. DAG size of input: 624 DAG size of output: 148 [2020-12-23 03:42:08,196 INFO L189 CegarLoopUtils]: For program point L498(lines 498 509) no Hoare annotation was computed. [2020-12-23 03:42:08,197 INFO L189 CegarLoopUtils]: For program point L432(lines 432 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,197 INFO L189 CegarLoopUtils]: For program point L498-2(lines 498 509) no Hoare annotation was computed. [2020-12-23 03:42:08,197 INFO L189 CegarLoopUtils]: For program point L168-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,197 INFO L189 CegarLoopUtils]: For program point L102-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,197 INFO L189 CegarLoopUtils]: For program point L36-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,197 INFO L189 CegarLoopUtils]: For program point L1027(lines 1027 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,197 INFO L189 CegarLoopUtils]: For program point L631(lines 631 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,197 INFO L189 CegarLoopUtils]: For program point L565(lines 565 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,197 INFO L189 CegarLoopUtils]: For program point L169(line 169) no Hoare annotation was computed. [2020-12-23 03:42:08,198 INFO L189 CegarLoopUtils]: For program point L103(line 103) no Hoare annotation was computed. [2020-12-23 03:42:08,198 INFO L189 CegarLoopUtils]: For program point L37(line 37) no Hoare annotation was computed. [2020-12-23 03:42:08,198 INFO L189 CegarLoopUtils]: For program point L896(lines 896 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,198 INFO L189 CegarLoopUtils]: For program point L698(lines 698 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,198 INFO L189 CegarLoopUtils]: For program point L368(lines 368 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,198 INFO L189 CegarLoopUtils]: For program point L963(lines 963 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,199 INFO L189 CegarLoopUtils]: For program point L237(lines 237 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,199 INFO L189 CegarLoopUtils]: For program point L171-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,199 INFO L189 CegarLoopUtils]: For program point L105-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,199 INFO L189 CegarLoopUtils]: For program point L39-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,199 INFO L189 CegarLoopUtils]: For program point L832(lines 832 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,199 INFO L189 CegarLoopUtils]: For program point L304(lines 304 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,199 INFO L189 CegarLoopUtils]: For program point L172(line 172) no Hoare annotation was computed. [2020-12-23 03:42:08,200 INFO L189 CegarLoopUtils]: For program point L106(line 106) no Hoare annotation was computed. [2020-12-23 03:42:08,200 INFO L189 CegarLoopUtils]: For program point L40(line 40) no Hoare annotation was computed. [2020-12-23 03:42:08,200 INFO L189 CegarLoopUtils]: For program point L767(lines 767 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,200 INFO L189 CegarLoopUtils]: For program point L768(lines 768 778) no Hoare annotation was computed. [2020-12-23 03:42:08,200 INFO L189 CegarLoopUtils]: For program point L768-2(lines 768 778) no Hoare annotation was computed. [2020-12-23 03:42:08,200 INFO L189 CegarLoopUtils]: For program point L174-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,200 INFO L189 CegarLoopUtils]: For program point L108-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,200 INFO L189 CegarLoopUtils]: For program point L42-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,200 INFO L189 CegarLoopUtils]: For program point L835(lines 835 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,200 INFO L189 CegarLoopUtils]: For program point L571(lines 571 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,200 INFO L189 CegarLoopUtils]: For program point L439(lines 439 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,201 INFO L189 CegarLoopUtils]: For program point L175(line 175) no Hoare annotation was computed. [2020-12-23 03:42:08,201 INFO L189 CegarLoopUtils]: For program point L109(line 109) no Hoare annotation was computed. [2020-12-23 03:42:08,201 INFO L189 CegarLoopUtils]: For program point L43(line 43) no Hoare annotation was computed. [2020-12-23 03:42:08,201 INFO L189 CegarLoopUtils]: For program point L968(lines 968 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,201 INFO L189 CegarLoopUtils]: For program point L704(lines 704 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,201 INFO L189 CegarLoopUtils]: For program point L638(lines 638 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,202 INFO L185 CegarLoopUtils]: At program point L1035(lines 32 1036) the Hoare annotation is: (let ((.cse14 (<= 246 ~a29~0)) (.cse8 (= ~a4~0 0)) (.cse24 (<= (+ ~a29~0 320173) 0)) (.cse21 (= ~a25~0 13)) (.cse23 (<= ~a29~0 274)) (.cse15 (<= (+ ~a23~0 43) 0)) (.cse3 (<= ~a25~0 9)) (.cse17 (<= ~a29~0 140)) (.cse4 (<= ~a23~0 312)) (.cse7 (= ~a4~0 1)) (.cse18 (<= 0 (+ ~a29~0 580294))) (.cse22 (<= ~a25~0 10)) (.cse10 (= ~a25~0 12))) (let ((.cse5 (let ((.cse27 (<= ~a29~0 130))) (or (and .cse22 .cse27) (and .cse27 .cse10)))) (.cse6 (<= ~a8~0 15)) (.cse20 (<= 312 ~a23~0)) (.cse11 (<= ~a29~0 245)) (.cse16 (= ~a25~0 10)) (.cse19 (= ~a25~0 11)) (.cse0 (let ((.cse26 (<= (+ ~a23~0 119992) 0))) (or (and .cse22 .cse7 .cse14 .cse26) (and .cse23 .cse7 .cse14 .cse26) (and (or (and .cse8 .cse3 .cse24 .cse15) (and .cse21 .cse23 .cse15 .cse7) (and .cse3 .cse17 .cse4 .cse7)) .cse18)))) (.cse13 (<= ~a23~0 600000)) (.cse12 (<= (+ ~a23~0 55) 0)) (.cse9 (<= 141 ~a29~0)) (.cse1 (= ~a8~0 15)) (.cse2 (= ~a3~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse10 .cse11 .cse2 .cse12) (and .cse1 .cse10 .cse13 .cse7 .cse14 .cse2) (and .cse15 .cse5 .cse6 .cse7) (and (or (and .cse8 .cse16 .cse17 .cse18 .cse12) (and .cse19 .cse8 .cse17 .cse15 .cse18)) .cse1 .cse2) (and (or (and .cse19 .cse20 .cse1 (<= ~a29~0 220) .cse7) (and .cse1 .cse10 (<= ~a29~0 232) .cse7)) .cse9 .cse13 .cse2) (and .cse21 .cse1 .cse13 .cse7 .cse2) (and (<= ~a29~0 275) .cse8 .cse1 .cse10 .cse14 .cse2) (and .cse16 .cse15 .cse6 .cse7) (and .cse22 .cse20 .cse9 .cse1 .cse11 .cse7 .cse2) (and .cse19 .cse1 .cse13 .cse7 .cse14 .cse2) (and .cse4 .cse1 .cse10 .cse7 .cse2) (and .cse16 .cse1 .cse13 .cse7 .cse2) (and (<= 27009 ~a29~0) .cse1 .cse13 .cse7 .cse2) (and .cse19 .cse0 .cse1) (and .cse3 .cse1 .cse13 .cse7 .cse14 .cse2) (and (or (and .cse8 .cse21 .cse23 .cse15 .cse14) (and .cse8 .cse3 (<= ~a29~0 310110) .cse15 .cse14)) .cse1 .cse2) (and .cse8 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse24 .cse1 .cse10 .cse18 .cse2 .cse12) (let ((.cse25 (<= ~a23~0 306))) (and (= ~a25~0 9) (or .cse25 (not (= 5 ULTIMATE.start_calculate_output_~input))) .cse9 .cse1 .cse7 .cse2 (or .cse25 (<= ~a29~0 234))))))) [2020-12-23 03:42:08,202 INFO L189 CegarLoopUtils]: For program point L903(lines 903 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,202 INFO L189 CegarLoopUtils]: For program point L705(lines 705 715) no Hoare annotation was computed. [2020-12-23 03:42:08,202 INFO L189 CegarLoopUtils]: For program point L705-2(lines 705 715) no Hoare annotation was computed. [2020-12-23 03:42:08,202 INFO L189 CegarLoopUtils]: For program point L375(lines 375 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,202 INFO L189 CegarLoopUtils]: For program point L309(lines 309 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,202 INFO L189 CegarLoopUtils]: For program point L243(lines 243 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,202 INFO L189 CegarLoopUtils]: For program point L177-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,203 INFO L189 CegarLoopUtils]: For program point L111-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,203 INFO L189 CegarLoopUtils]: For program point L45-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,203 INFO L189 CegarLoopUtils]: For program point L178(line 178) no Hoare annotation was computed. [2020-12-23 03:42:08,203 INFO L189 CegarLoopUtils]: For program point L112(line 112) no Hoare annotation was computed. [2020-12-23 03:42:08,203 INFO L189 CegarLoopUtils]: For program point L46(line 46) no Hoare annotation was computed. [2020-12-23 03:42:08,203 INFO L192 CegarLoopUtils]: At program point L1038(lines 1038 1054) the Hoare annotation is: true [2020-12-23 03:42:08,203 INFO L189 CegarLoopUtils]: For program point L576(lines 576 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,203 INFO L189 CegarLoopUtils]: For program point L510(lines 510 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,203 INFO L189 CegarLoopUtils]: For program point L180-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,203 INFO L189 CegarLoopUtils]: For program point L114-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,203 INFO L189 CegarLoopUtils]: For program point L48-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,203 INFO L189 CegarLoopUtils]: For program point L973(lines 973 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,203 INFO L189 CegarLoopUtils]: For program point L841(lines 841 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,203 INFO L189 CegarLoopUtils]: For program point L181(line 181) no Hoare annotation was computed. [2020-12-23 03:42:08,204 INFO L189 CegarLoopUtils]: For program point L115(line 115) no Hoare annotation was computed. [2020-12-23 03:42:08,204 INFO L189 CegarLoopUtils]: For program point L49(line 49) no Hoare annotation was computed. [2020-12-23 03:42:08,204 INFO L189 CegarLoopUtils]: For program point L908(lines 908 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,204 INFO L189 CegarLoopUtils]: For program point L446(lines 446 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,204 INFO L189 CegarLoopUtils]: For program point L380(lines 380 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,204 INFO L189 CegarLoopUtils]: For program point L645(lines 645 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,204 INFO L189 CegarLoopUtils]: For program point L315(lines 315 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,204 INFO L189 CegarLoopUtils]: For program point L183-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,204 INFO L189 CegarLoopUtils]: For program point L117-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,204 INFO L189 CegarLoopUtils]: For program point L51-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,204 INFO L189 CegarLoopUtils]: For program point L250(lines 250 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,204 INFO L189 CegarLoopUtils]: For program point L184(line 184) no Hoare annotation was computed. [2020-12-23 03:42:08,205 INFO L189 CegarLoopUtils]: For program point L118(line 118) no Hoare annotation was computed. [2020-12-23 03:42:08,205 INFO L189 CegarLoopUtils]: For program point L52(line 52) no Hoare annotation was computed. [2020-12-23 03:42:08,205 INFO L189 CegarLoopUtils]: For program point L779(lines 779 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,205 INFO L185 CegarLoopUtils]: At program point L1044-2(lines 1044 1053) the Hoare annotation is: (let ((.cse14 (<= 246 ~a29~0)) (.cse8 (= ~a4~0 0)) (.cse24 (<= (+ ~a29~0 320173) 0)) (.cse21 (= ~a25~0 13)) (.cse23 (<= ~a29~0 274)) (.cse15 (<= (+ ~a23~0 43) 0)) (.cse3 (<= ~a25~0 9)) (.cse17 (<= ~a29~0 140)) (.cse4 (<= ~a23~0 312)) (.cse7 (= ~a4~0 1)) (.cse18 (<= 0 (+ ~a29~0 580294))) (.cse22 (<= ~a25~0 10)) (.cse10 (= ~a25~0 12))) (let ((.cse5 (let ((.cse27 (<= ~a29~0 130))) (or (and .cse22 .cse27) (and .cse27 .cse10)))) (.cse6 (<= ~a8~0 15)) (.cse20 (<= 312 ~a23~0)) (.cse11 (<= ~a29~0 245)) (.cse16 (= ~a25~0 10)) (.cse19 (= ~a25~0 11)) (.cse0 (let ((.cse26 (<= (+ ~a23~0 119992) 0))) (or (and .cse22 .cse7 .cse14 .cse26) (and .cse23 .cse7 .cse14 .cse26) (and (or (and .cse8 .cse3 .cse24 .cse15) (and .cse21 .cse23 .cse15 .cse7) (and .cse3 .cse17 .cse4 .cse7)) .cse18)))) (.cse13 (<= ~a23~0 600000)) (.cse12 (<= (+ ~a23~0 55) 0)) (.cse9 (<= 141 ~a29~0)) (.cse1 (= ~a8~0 15)) (.cse2 (= ~a3~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse10 .cse11 .cse2 .cse12) (and .cse1 .cse10 .cse13 .cse7 .cse14 .cse2) (and .cse15 .cse5 .cse6 .cse7) (and (or (and .cse8 .cse16 .cse17 .cse18 .cse12) (and .cse19 .cse8 .cse17 .cse15 .cse18)) .cse1 .cse2) (and (or (and .cse19 .cse20 .cse1 (<= ~a29~0 220) .cse7) (and .cse1 .cse10 (<= ~a29~0 232) .cse7)) .cse9 .cse13 .cse2) (and .cse21 .cse1 .cse13 .cse7 .cse2) (and (<= ~a29~0 275) .cse8 .cse1 .cse10 .cse14 .cse2) (and .cse16 .cse15 .cse6 .cse7) (and .cse22 .cse20 .cse9 .cse1 .cse11 .cse7 .cse2) (and .cse19 .cse1 .cse13 .cse7 .cse14 .cse2) (and .cse4 .cse1 .cse10 .cse7 .cse2) (and .cse16 .cse1 .cse13 .cse7 .cse2) (and (<= 27009 ~a29~0) .cse1 .cse13 .cse7 .cse2) (and .cse19 .cse0 .cse1) (and .cse3 .cse1 .cse13 .cse7 .cse14 .cse2) (and (or (and .cse8 .cse21 .cse23 .cse15 .cse14) (and .cse8 .cse3 (<= ~a29~0 310110) .cse15 .cse14)) .cse1 .cse2) (and .cse8 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse24 .cse1 .cse10 .cse18 .cse2 .cse12) (let ((.cse25 (<= ~a23~0 306))) (and (= ~a25~0 9) (or .cse25 (not (= 5 ULTIMATE.start_calculate_output_~input))) .cse9 .cse1 .cse7 .cse2 (or .cse25 (<= ~a29~0 234))))))) [2020-12-23 03:42:08,205 INFO L189 CegarLoopUtils]: For program point L846(lines 846 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,205 INFO L189 CegarLoopUtils]: For program point L582(lines 582 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,205 INFO L189 CegarLoopUtils]: For program point L186-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,205 INFO L189 CegarLoopUtils]: For program point L120-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,205 INFO L189 CegarLoopUtils]: For program point L54-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,205 INFO L189 CegarLoopUtils]: For program point L979(lines 979 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,205 INFO L189 CegarLoopUtils]: For program point L913(lines 913 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,205 INFO L189 CegarLoopUtils]: For program point L517(lines 517 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L187(line 187) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L121(line 121) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L55(line 55) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L980(lines 980 990) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L914(lines 914 924) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L980-2(lines 980 990) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L914-2(lines 914 924) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L716(lines 716 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L320(lines 320 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L585(lines 585 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L453(lines 453 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L387(lines 387 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L189-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L123-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L57-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L784(lines 784 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point L652(lines 652 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,206 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L190(line 190) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L124(line 124) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L58(line 58) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L1049(line 1049) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L851(lines 851 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L257(lines 257 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L192-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L126-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L60-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L193(line 193) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L127(line 127) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L61(line 61) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L722(lines 722 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L524(lines 524 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L657(lines 657 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L591(lines 591 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,207 INFO L189 CegarLoopUtils]: For program point L525(lines 525 535) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L525-2(lines 525 535) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L327(lines 327 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L195-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L129-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L63-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L856(lines 856 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L790(lines 790 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L658(lines 658 667) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L658-2(lines 658 667) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L460(lines 460 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L394(lines 394 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L196(line 196) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L130(line 130) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L64(line 64) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2020-12-23 03:42:08,208 INFO L189 CegarLoopUtils]: For program point L264(lines 264 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,209 INFO L189 CegarLoopUtils]: For program point L198-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,209 INFO L189 CegarLoopUtils]: For program point L132-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,209 INFO L189 CegarLoopUtils]: For program point L66-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,209 INFO L189 CegarLoopUtils]: For program point L991(lines 991 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,209 INFO L189 CegarLoopUtils]: For program point L925(lines 925 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,209 INFO L189 CegarLoopUtils]: For program point L727(lines 727 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,209 INFO L189 CegarLoopUtils]: For program point L199(line 199) no Hoare annotation was computed. [2020-12-23 03:42:08,209 INFO L189 CegarLoopUtils]: For program point L133(line 133) no Hoare annotation was computed. [2020-12-23 03:42:08,209 INFO L189 CegarLoopUtils]: For program point L67(line 67) no Hoare annotation was computed. [2020-12-23 03:42:08,209 INFO L189 CegarLoopUtils]: For program point L926(lines 926 936) no Hoare annotation was computed. [2020-12-23 03:42:08,209 INFO L189 CegarLoopUtils]: For program point L926-2(lines 926 936) no Hoare annotation was computed. [2020-12-23 03:42:08,209 INFO L189 CegarLoopUtils]: For program point L728(lines 728 740) no Hoare annotation was computed. [2020-12-23 03:42:08,210 INFO L189 CegarLoopUtils]: For program point L728-2(lines 728 740) no Hoare annotation was computed. [2020-12-23 03:42:08,210 INFO L189 CegarLoopUtils]: For program point L596(lines 596 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,210 INFO L189 CegarLoopUtils]: For program point L332(lines 332 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,210 INFO L189 CegarLoopUtils]: For program point L597(lines 597 607) no Hoare annotation was computed. [2020-12-23 03:42:08,210 INFO L189 CegarLoopUtils]: For program point L597-2(lines 597 607) no Hoare annotation was computed. [2020-12-23 03:42:08,210 INFO L189 CegarLoopUtils]: For program point L201-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,210 INFO L189 CegarLoopUtils]: For program point L135-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,210 INFO L189 CegarLoopUtils]: For program point L69-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,210 INFO L189 CegarLoopUtils]: For program point L862(lines 862 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,210 INFO L189 CegarLoopUtils]: For program point L466(lines 466 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,211 INFO L189 CegarLoopUtils]: For program point L202(line 202) no Hoare annotation was computed. [2020-12-23 03:42:08,211 INFO L189 CegarLoopUtils]: For program point L136(line 136) no Hoare annotation was computed. [2020-12-23 03:42:08,211 INFO L189 CegarLoopUtils]: For program point L70(line 70) no Hoare annotation was computed. [2020-12-23 03:42:08,211 INFO L189 CegarLoopUtils]: For program point L797(lines 797 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,211 INFO L189 CegarLoopUtils]: For program point L401(lines 401 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,211 INFO L189 CegarLoopUtils]: For program point L270(lines 270 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,211 INFO L189 CegarLoopUtils]: For program point L204-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,211 INFO L189 CegarLoopUtils]: For program point L138-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,211 INFO L189 CegarLoopUtils]: For program point L72-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,211 INFO L189 CegarLoopUtils]: For program point L205(line 205) no Hoare annotation was computed. [2020-12-23 03:42:08,212 INFO L189 CegarLoopUtils]: For program point L139(line 139) no Hoare annotation was computed. [2020-12-23 03:42:08,212 INFO L189 CegarLoopUtils]: For program point L73(line 73) no Hoare annotation was computed. [2020-12-23 03:42:08,212 INFO L189 CegarLoopUtils]: For program point L998(lines 998 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,212 INFO L189 CegarLoopUtils]: For program point L668(lines 668 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,212 INFO L189 CegarLoopUtils]: For program point L536(lines 536 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,212 INFO L189 CegarLoopUtils]: For program point L339(lines 339 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,212 INFO L189 CegarLoopUtils]: For program point L207-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,212 INFO L189 CegarLoopUtils]: For program point L141-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,212 INFO L189 CegarLoopUtils]: For program point L75-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,212 INFO L189 CegarLoopUtils]: For program point L802(lines 802 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,213 INFO L189 CegarLoopUtils]: For program point L208(line 208) no Hoare annotation was computed. [2020-12-23 03:42:08,213 INFO L189 CegarLoopUtils]: For program point L142(line 142) no Hoare annotation was computed. [2020-12-23 03:42:08,213 INFO L189 CegarLoopUtils]: For program point L76(line 76) no Hoare annotation was computed. [2020-12-23 03:42:08,213 INFO L189 CegarLoopUtils]: For program point L869(lines 869 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,213 INFO L189 CegarLoopUtils]: For program point L473(lines 473 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,213 INFO L189 CegarLoopUtils]: For program point L275(lines 275 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,213 INFO L189 CegarLoopUtils]: For program point L408(lines 408 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,213 INFO L189 CegarLoopUtils]: For program point L210-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,213 INFO L189 CegarLoopUtils]: For program point L144-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,213 INFO L189 CegarLoopUtils]: For program point L78-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,214 INFO L189 CegarLoopUtils]: For program point L1003(lines 1003 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,214 INFO L189 CegarLoopUtils]: For program point L937(lines 937 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,214 INFO L189 CegarLoopUtils]: For program point L673(lines 673 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,214 INFO L189 CegarLoopUtils]: For program point L541(lines 541 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,214 INFO L189 CegarLoopUtils]: For program point L409(lines 409 420) no Hoare annotation was computed. [2020-12-23 03:42:08,214 INFO L189 CegarLoopUtils]: For program point L409-2(lines 409 420) no Hoare annotation was computed. [2020-12-23 03:42:08,214 INFO L189 CegarLoopUtils]: For program point L211(line 211) no Hoare annotation was computed. [2020-12-23 03:42:08,214 INFO L189 CegarLoopUtils]: For program point L145(line 145) no Hoare annotation was computed. [2020-12-23 03:42:08,215 INFO L189 CegarLoopUtils]: For program point L79(line 79) no Hoare annotation was computed. [2020-12-23 03:42:08,215 INFO L189 CegarLoopUtils]: For program point L608(lines 608 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,215 INFO L189 CegarLoopUtils]: For program point L344(lines 344 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,215 INFO L189 CegarLoopUtils]: For program point L278(lines 278 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,215 INFO L189 CegarLoopUtils]: For program point L741(lines 741 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,215 INFO L189 CegarLoopUtils]: For program point L213-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,215 INFO L189 CegarLoopUtils]: For program point L147-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,216 INFO L189 CegarLoopUtils]: For program point L81-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,216 INFO L189 CegarLoopUtils]: For program point L214(line 214) no Hoare annotation was computed. [2020-12-23 03:42:08,216 INFO L189 CegarLoopUtils]: For program point L148(line 148) no Hoare annotation was computed. [2020-12-23 03:42:08,216 INFO L189 CegarLoopUtils]: For program point L82(line 82) no Hoare annotation was computed. [2020-12-23 03:42:08,216 INFO L189 CegarLoopUtils]: For program point L875(lines 875 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,216 INFO L189 CegarLoopUtils]: For program point L809(lines 809 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,216 INFO L189 CegarLoopUtils]: For program point L942(lines 942 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,216 INFO L189 CegarLoopUtils]: For program point L876(lines 876 885) no Hoare annotation was computed. [2020-12-23 03:42:08,216 INFO L189 CegarLoopUtils]: For program point L876-2(lines 876 885) no Hoare annotation was computed. [2020-12-23 03:42:08,216 INFO L189 CegarLoopUtils]: For program point L480(lines 480 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,216 INFO L189 CegarLoopUtils]: For program point L150-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,217 INFO L189 CegarLoopUtils]: For program point L84-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,217 INFO L189 CegarLoopUtils]: For program point L613(lines 613 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,217 INFO L189 CegarLoopUtils]: For program point L547(lines 547 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,217 INFO L189 CegarLoopUtils]: For program point L151(line 151) no Hoare annotation was computed. [2020-12-23 03:42:08,217 INFO L189 CegarLoopUtils]: For program point L85(line 85) no Hoare annotation was computed. [2020-12-23 03:42:08,217 INFO L189 CegarLoopUtils]: For program point L1010(lines 1010 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,217 INFO L189 CegarLoopUtils]: For program point L680(lines 680 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,217 INFO L189 CegarLoopUtils]: For program point L614(lines 614 624) no Hoare annotation was computed. [2020-12-23 03:42:08,217 INFO L189 CegarLoopUtils]: For program point L614-2(lines 614 624) no Hoare annotation was computed. [2020-12-23 03:42:08,217 INFO L189 CegarLoopUtils]: For program point L350(lines 350 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,217 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 03:42:08,218 INFO L189 CegarLoopUtils]: For program point L285(lines 285 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,218 INFO L189 CegarLoopUtils]: For program point L153-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,218 INFO L189 CegarLoopUtils]: For program point L87-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,218 INFO L189 CegarLoopUtils]: For program point L814(lines 814 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,218 INFO L189 CegarLoopUtils]: For program point L748(lines 748 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,218 INFO L189 CegarLoopUtils]: For program point L154(line 154) no Hoare annotation was computed. [2020-12-23 03:42:08,218 INFO L189 CegarLoopUtils]: For program point L88(line 88) no Hoare annotation was computed. [2020-12-23 03:42:08,218 INFO L189 CegarLoopUtils]: For program point L815(lines 815 825) no Hoare annotation was computed. [2020-12-23 03:42:08,218 INFO L189 CegarLoopUtils]: For program point L815-2(lines 815 825) no Hoare annotation was computed. [2020-12-23 03:42:08,218 INFO L189 CegarLoopUtils]: For program point L552(lines 552 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,219 INFO L189 CegarLoopUtils]: For program point L156-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,219 INFO L189 CegarLoopUtils]: For program point L90-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,219 INFO L189 CegarLoopUtils]: For program point L1015(lines 1015 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,219 INFO L189 CegarLoopUtils]: For program point L949(lines 949 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,219 INFO L189 CegarLoopUtils]: For program point L685(lines 685 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,219 INFO L189 CegarLoopUtils]: For program point L487(lines 487 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,219 INFO L189 CegarLoopUtils]: For program point L421(lines 421 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,219 INFO L189 CegarLoopUtils]: For program point L157(line 157) no Hoare annotation was computed. [2020-12-23 03:42:08,219 INFO L189 CegarLoopUtils]: For program point L91(line 91) no Hoare annotation was computed. [2020-12-23 03:42:08,219 INFO L189 CegarLoopUtils]: For program point L950(lines 950 962) no Hoare annotation was computed. [2020-12-23 03:42:08,219 INFO L189 CegarLoopUtils]: For program point L950-2(lines 950 962) no Hoare annotation was computed. [2020-12-23 03:42:08,220 INFO L189 CegarLoopUtils]: For program point L488(lines 488 496) no Hoare annotation was computed. [2020-12-23 03:42:08,220 INFO L189 CegarLoopUtils]: For program point L488-2(lines 488 496) no Hoare annotation was computed. [2020-12-23 03:42:08,220 INFO L189 CegarLoopUtils]: For program point L356(lines 356 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,220 INFO L189 CegarLoopUtils]: For program point L290(lines 290 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,220 INFO L189 CegarLoopUtils]: For program point L224(lines 224 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,220 INFO L189 CegarLoopUtils]: For program point L753(lines 753 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,220 INFO L189 CegarLoopUtils]: For program point L159-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,220 INFO L189 CegarLoopUtils]: For program point L93-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,220 INFO L189 CegarLoopUtils]: For program point L886(lines 886 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,220 INFO L189 CegarLoopUtils]: For program point L160(line 160) no Hoare annotation was computed. [2020-12-23 03:42:08,221 INFO L189 CegarLoopUtils]: For program point L94(line 94) no Hoare annotation was computed. [2020-12-23 03:42:08,221 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 03:42:08,221 INFO L189 CegarLoopUtils]: For program point L162-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,221 INFO L189 CegarLoopUtils]: For program point L96-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,221 INFO L189 CegarLoopUtils]: For program point L691(lines 691 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,221 INFO L189 CegarLoopUtils]: For program point L625(lines 625 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,221 INFO L189 CegarLoopUtils]: For program point L559(lines 559 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,221 INFO L189 CegarLoopUtils]: For program point L427(lines 427 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,221 INFO L189 CegarLoopUtils]: For program point L163(line 163) no Hoare annotation was computed. [2020-12-23 03:42:08,221 INFO L189 CegarLoopUtils]: For program point L97(line 97) no Hoare annotation was computed. [2020-12-23 03:42:08,222 INFO L189 CegarLoopUtils]: For program point L1022(lines 1022 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,222 INFO L189 CegarLoopUtils]: For program point L891(lines 891 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,222 INFO L189 CegarLoopUtils]: For program point L363(lines 363 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,222 INFO L189 CegarLoopUtils]: For program point L297(lines 297 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,222 INFO L189 CegarLoopUtils]: For program point L231(lines 231 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,222 INFO L189 CegarLoopUtils]: For program point L165-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,222 INFO L189 CegarLoopUtils]: For program point L99-1(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,222 INFO L189 CegarLoopUtils]: For program point L33(lines 33 35) no Hoare annotation was computed. [2020-12-23 03:42:08,222 INFO L189 CegarLoopUtils]: For program point L33-2(lines 32 1036) no Hoare annotation was computed. [2020-12-23 03:42:08,222 INFO L189 CegarLoopUtils]: For program point L826(lines 826 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,222 INFO L189 CegarLoopUtils]: For program point L760(lines 760 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,223 INFO L189 CegarLoopUtils]: For program point L166(line 166) no Hoare annotation was computed. [2020-12-23 03:42:08,223 INFO L189 CegarLoopUtils]: For program point L100(line 100) no Hoare annotation was computed. [2020-12-23 03:42:08,223 INFO L189 CegarLoopUtils]: For program point L34(line 34) no Hoare annotation was computed. [2020-12-23 03:42:08,223 INFO L189 CegarLoopUtils]: For program point L497(lines 497 1034) no Hoare annotation was computed. [2020-12-23 03:42:08,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 03:42:08 BoogieIcfgContainer [2020-12-23 03:42:08,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 03:42:08,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 03:42:08,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 03:42:08,263 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 03:42:08,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:40:02" (3/4) ... [2020-12-23 03:42:08,266 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 03:42:08,296 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-23 03:42:08,298 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-23 03:42:08,299 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 03:42:08,301 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 03:42:08,494 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem11_label26.c-witness.graphml [2020-12-23 03:42:08,494 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 03:42:08,495 INFO L168 Benchmark]: Toolchain (without parser) took 129158.51 ms. Allocated memory was 158.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 130.0 MB in the beginning and 946.3 MB in the end (delta: -816.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. [2020-12-23 03:42:08,496 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 158.3 MB. Free memory is still 131.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 03:42:08,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1009.67 ms. Allocated memory is still 158.3 MB. Free memory was 129.8 MB in the beginning and 121.4 MB in the end (delta: 8.4 MB). Peak memory consumption was 32.9 MB. Max. memory is 8.0 GB. [2020-12-23 03:42:08,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.18 ms. Allocated memory is still 158.3 MB. Free memory was 120.8 MB in the beginning and 104.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2020-12-23 03:42:08,497 INFO L168 Benchmark]: Boogie Preprocessor took 182.60 ms. Allocated memory is still 158.3 MB. Free memory was 104.1 MB in the beginning and 93.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-12-23 03:42:08,497 INFO L168 Benchmark]: RCFGBuilder took 1767.10 ms. Allocated memory was 158.3 MB in the beginning and 190.8 MB in the end (delta: 32.5 MB). Free memory was 93.6 MB in the beginning and 146.9 MB in the end (delta: -53.3 MB). Peak memory consumption was 68.8 MB. Max. memory is 8.0 GB. [2020-12-23 03:42:08,498 INFO L168 Benchmark]: TraceAbstraction took 125817.78 ms. Allocated memory was 190.8 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 146.4 MB in the beginning and 972.8 MB in the end (delta: -826.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 8.0 GB. [2020-12-23 03:42:08,498 INFO L168 Benchmark]: Witness Printer took 231.66 ms. Allocated memory is still 2.5 GB. Free memory was 972.8 MB in the beginning and 946.3 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. [2020-12-23 03:42:08,500 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.16 ms. Allocated memory is still 158.3 MB. Free memory is still 131.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1009.67 ms. Allocated memory is still 158.3 MB. Free memory was 129.8 MB in the beginning and 121.4 MB in the end (delta: 8.4 MB). Peak memory consumption was 32.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 141.18 ms. Allocated memory is still 158.3 MB. Free memory was 120.8 MB in the beginning and 104.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 182.60 ms. Allocated memory is still 158.3 MB. Free memory was 104.1 MB in the beginning and 93.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1767.10 ms. Allocated memory was 158.3 MB in the beginning and 190.8 MB in the end (delta: 32.5 MB). Free memory was 93.6 MB in the beginning and 146.9 MB in the end (delta: -53.3 MB). Peak memory consumption was 68.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 125817.78 ms. Allocated memory was 190.8 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 146.4 MB in the beginning and 972.8 MB in the end (delta: -826.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 8.0 GB. * Witness Printer took 231.66 ms. Allocated memory is still 2.5 GB. Free memory was 972.8 MB in the beginning and 946.3 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 1038]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((a25 <= 10 && a4 == 1) && 246 <= a29) && a23 + 119992 <= 0) || (((a29 <= 274 && a4 == 1) && 246 <= a29) && a23 + 119992 <= 0)) || ((((((a4 == 0 && a25 <= 9) && a29 + 320173 <= 0) && a23 + 43 <= 0) || (((a25 == 13 && a29 <= 274) && a23 + 43 <= 0) && a4 == 1)) || (((a25 <= 9 && a29 <= 140) && a23 <= 312) && a4 == 1)) && 0 <= a29 + 580294)) && a8 == 15) && a3 == 1) || ((((a25 <= 9 && a23 <= 312) && ((a25 <= 10 && a29 <= 130) || (a29 <= 130 && a25 == 12))) && a8 <= 15) && a4 == 1)) || ((((((a4 == 0 && 141 <= a29) && a8 == 15) && a25 == 12) && a29 <= 245) && a3 == 1) && a23 + 55 <= 0)) || (((((a8 == 15 && a25 == 12) && a23 <= 600000) && a4 == 1) && 246 <= a29) && a3 == 1)) || (((a23 + 43 <= 0 && ((a25 <= 10 && a29 <= 130) || (a29 <= 130 && a25 == 12))) && a8 <= 15) && a4 == 1)) || (((((((a4 == 0 && a25 == 10) && a29 <= 140) && 0 <= a29 + 580294) && a23 + 55 <= 0) || ((((a25 == 11 && a4 == 0) && a29 <= 140) && a23 + 43 <= 0) && 0 <= a29 + 580294)) && a8 == 15) && a3 == 1)) || ((((((((a25 == 11 && 312 <= a23) && a8 == 15) && a29 <= 220) && a4 == 1) || (((a8 == 15 && a25 == 12) && a29 <= 232) && a4 == 1)) && 141 <= a29) && a23 <= 600000) && a3 == 1)) || ((((a25 == 13 && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1)) || (((((a29 <= 275 && a4 == 0) && a8 == 15) && a25 == 12) && 246 <= a29) && a3 == 1)) || (((a25 == 10 && a23 + 43 <= 0) && a8 <= 15) && a4 == 1)) || ((((((a25 <= 10 && 312 <= a23) && 141 <= a29) && a8 == 15) && a29 <= 245) && a4 == 1) && a3 == 1)) || (((((a25 == 11 && a8 == 15) && a23 <= 600000) && a4 == 1) && 246 <= a29) && a3 == 1)) || ((((a23 <= 312 && a8 == 15) && a25 == 12) && a4 == 1) && a3 == 1)) || ((((a25 == 10 && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1)) || ((((27009 <= a29 && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1)) || ((a25 == 11 && (((((a25 <= 10 && a4 == 1) && 246 <= a29) && a23 + 119992 <= 0) || (((a29 <= 274 && a4 == 1) && 246 <= a29) && a23 + 119992 <= 0)) || ((((((a4 == 0 && a25 <= 9) && a29 + 320173 <= 0) && a23 + 43 <= 0) || (((a25 == 13 && a29 <= 274) && a23 + 43 <= 0) && a4 == 1)) || (((a25 <= 9 && a29 <= 140) && a23 <= 312) && a4 == 1)) && 0 <= a29 + 580294))) && a8 == 15)) || (((((a25 <= 9 && a8 == 15) && a23 <= 600000) && a4 == 1) && 246 <= a29) && a3 == 1)) || (((((((a4 == 0 && a25 == 13) && a29 <= 274) && a23 + 43 <= 0) && 246 <= a29) || ((((a4 == 0 && a25 <= 9) && a29 <= 310110) && a23 + 43 <= 0) && 246 <= a29)) && a8 == 15) && a3 == 1)) || (((((((a4 == 0 && !(6 == input)) && a29 + 320173 <= 0) && a8 == 15) && a25 == 12) && 0 <= a29 + 580294) && a3 == 1) && a23 + 55 <= 0)) || ((((((a25 == 9 && (a23 <= 306 || !(5 == input))) && 141 <= a29) && a8 == 15) && a4 == 1) && a3 == 1) && (a23 <= 306 || a29 <= 234)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((a25 <= 10 && a4 == 1) && 246 <= a29) && a23 + 119992 <= 0) || (((a29 <= 274 && a4 == 1) && 246 <= a29) && a23 + 119992 <= 0)) || ((((((a4 == 0 && a25 <= 9) && a29 + 320173 <= 0) && a23 + 43 <= 0) || (((a25 == 13 && a29 <= 274) && a23 + 43 <= 0) && a4 == 1)) || (((a25 <= 9 && a29 <= 140) && a23 <= 312) && a4 == 1)) && 0 <= a29 + 580294)) && a8 == 15) && a3 == 1) || ((((a25 <= 9 && a23 <= 312) && ((a25 <= 10 && a29 <= 130) || (a29 <= 130 && a25 == 12))) && a8 <= 15) && a4 == 1)) || ((((((a4 == 0 && 141 <= a29) && a8 == 15) && a25 == 12) && a29 <= 245) && a3 == 1) && a23 + 55 <= 0)) || (((((a8 == 15 && a25 == 12) && a23 <= 600000) && a4 == 1) && 246 <= a29) && a3 == 1)) || (((a23 + 43 <= 0 && ((a25 <= 10 && a29 <= 130) || (a29 <= 130 && a25 == 12))) && a8 <= 15) && a4 == 1)) || (((((((a4 == 0 && a25 == 10) && a29 <= 140) && 0 <= a29 + 580294) && a23 + 55 <= 0) || ((((a25 == 11 && a4 == 0) && a29 <= 140) && a23 + 43 <= 0) && 0 <= a29 + 580294)) && a8 == 15) && a3 == 1)) || ((((((((a25 == 11 && 312 <= a23) && a8 == 15) && a29 <= 220) && a4 == 1) || (((a8 == 15 && a25 == 12) && a29 <= 232) && a4 == 1)) && 141 <= a29) && a23 <= 600000) && a3 == 1)) || ((((a25 == 13 && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1)) || (((((a29 <= 275 && a4 == 0) && a8 == 15) && a25 == 12) && 246 <= a29) && a3 == 1)) || (((a25 == 10 && a23 + 43 <= 0) && a8 <= 15) && a4 == 1)) || ((((((a25 <= 10 && 312 <= a23) && 141 <= a29) && a8 == 15) && a29 <= 245) && a4 == 1) && a3 == 1)) || (((((a25 == 11 && a8 == 15) && a23 <= 600000) && a4 == 1) && 246 <= a29) && a3 == 1)) || ((((a23 <= 312 && a8 == 15) && a25 == 12) && a4 == 1) && a3 == 1)) || ((((a25 == 10 && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1)) || ((((27009 <= a29 && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1)) || ((a25 == 11 && (((((a25 <= 10 && a4 == 1) && 246 <= a29) && a23 + 119992 <= 0) || (((a29 <= 274 && a4 == 1) && 246 <= a29) && a23 + 119992 <= 0)) || ((((((a4 == 0 && a25 <= 9) && a29 + 320173 <= 0) && a23 + 43 <= 0) || (((a25 == 13 && a29 <= 274) && a23 + 43 <= 0) && a4 == 1)) || (((a25 <= 9 && a29 <= 140) && a23 <= 312) && a4 == 1)) && 0 <= a29 + 580294))) && a8 == 15)) || (((((a25 <= 9 && a8 == 15) && a23 <= 600000) && a4 == 1) && 246 <= a29) && a3 == 1)) || (((((((a4 == 0 && a25 == 13) && a29 <= 274) && a23 + 43 <= 0) && 246 <= a29) || ((((a4 == 0 && a25 <= 9) && a29 <= 310110) && a23 + 43 <= 0) && 246 <= a29)) && a8 == 15) && a3 == 1)) || (((((((a4 == 0 && !(6 == input)) && a29 + 320173 <= 0) && a8 == 15) && a25 == 12) && 0 <= a29 + 580294) && a3 == 1) && a23 + 55 <= 0)) || ((((((a25 == 9 && (a23 <= 306 || !(5 == input))) && 141 <= a29) && a8 == 15) && a4 == 1) && a3 == 1) && (a23 <= 306 || a29 <= 234)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 105.8s, OverallIterations: 34, TraceHistogramMax: 15, AutomataDifference: 51.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5051 SDtfs, 8075 SDslu, 870 SDs, 0 SdLazy, 27558 SolverSat, 4093 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6292 GetRequests, 6189 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25090occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 43509 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 149 NumberOfFragments, 1265 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1798210 FormulaSimplificationTreeSizeReduction, 6.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1604929 FormulaSimplificationTreeSizeReductionInter, 13.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 27794 NumberOfCodeBlocks, 27794 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 27754 ConstructedInterpolants, 0 QuantifiedInterpolants, 83800119 SizeOfPredicates, 9 NumberOfNonLiveVariables, 7856 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 40 InterpolantComputations, 32 PerfectInterpolantSequences, 83090/84844 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...