/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_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 13:34:43,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 13:34:43,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 13:34:43,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 13:34:43,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 13:34:43,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 13:34:43,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 13:34:43,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 13:34:43,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 13:34:43,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 13:34:43,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 13:34:43,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 13:34:43,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 13:34:43,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 13:34:43,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 13:34:43,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 13:34:43,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 13:34:43,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 13:34:43,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 13:34:43,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 13:34:43,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 13:34:43,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 13:34:43,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 13:34:43,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 13:34:43,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 13:34:43,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 13:34:43,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 13:34:43,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 13:34:43,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 13:34:43,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 13:34:43,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 13:34:43,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 13:34:43,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 13:34:43,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 13:34:43,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 13:34:43,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 13:34:43,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 13:34:43,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 13:34:43,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 13:34:43,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 13:34:43,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 13:34:43,980 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 13:34:44,010 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 13:34:44,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 13:34:44,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 13:34:44,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 13:34:44,013 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 13:34:44,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 13:34:44,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 13:34:44,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 13:34:44,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 13:34:44,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 13:34:44,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 13:34:44,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 13:34:44,015 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 13:34:44,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 13:34:44,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 13:34:44,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 13:34:44,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 13:34:44,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 13:34:44,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 13:34:44,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 13:34:44,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 13:34:44,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 13:34:44,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 13:34:44,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 13:34:44,019 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 13:34:44,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 13:34:44,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 13:34:44,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 13:34:44,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 13:34:44,453 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 13:34:44,454 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 13:34:44,455 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label28.c [2021-01-06 13:34:44,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/28c0f6948/954bd9bdf8f141f69786ebf872a3141f/FLAGc1b8e4b0a [2021-01-06 13:34:45,388 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 13:34:45,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label28.c [2021-01-06 13:34:45,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/28c0f6948/954bd9bdf8f141f69786ebf872a3141f/FLAGc1b8e4b0a [2021-01-06 13:34:45,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/28c0f6948/954bd9bdf8f141f69786ebf872a3141f [2021-01-06 13:34:45,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 13:34:45,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 13:34:45,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 13:34:45,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 13:34:45,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 13:34:45,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:34:45" (1/1) ... [2021-01-06 13:34:45,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f463ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:45, skipping insertion in model container [2021-01-06 13:34:45,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:34:45" (1/1) ... [2021-01-06 13:34:45,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 13:34:45,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 13:34:46,032 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_label28.c[6999,7012] 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,] [2021-01-06 13:34:46,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:34:46,509 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 13:34:46,564 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_label28.c[6999,7012] 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,] [2021-01-06 13:34:46,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:34:46,768 INFO L208 MainTranslator]: Completed translation [2021-01-06 13:34:46,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:46 WrapperNode [2021-01-06 13:34:46,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 13:34:46,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 13:34:46,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 13:34:46,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 13:34:46,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:46" (1/1) ... [2021-01-06 13:34:46,825 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:46" (1/1) ... [2021-01-06 13:34:46,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 13:34:46,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 13:34:46,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 13:34:46,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 13:34:46,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:46" (1/1) ... [2021-01-06 13:34:46,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:46" (1/1) ... [2021-01-06 13:34:46,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:46" (1/1) ... [2021-01-06 13:34:47,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:46" (1/1) ... [2021-01-06 13:34:47,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:46" (1/1) ... [2021-01-06 13:34:47,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:46" (1/1) ... [2021-01-06 13:34:47,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:46" (1/1) ... [2021-01-06 13:34:47,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 13:34:47,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 13:34:47,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 13:34:47,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 13:34:47,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:46" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 13:34:47,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 13:34:47,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 13:34:47,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 13:34:47,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 13:34:49,054 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 13:34:49,055 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 13:34:49,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:34:49 BoogieIcfgContainer [2021-01-06 13:34:49,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 13:34:49,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 13:34:49,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 13:34:49,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 13:34:49,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 01:34:45" (1/3) ... [2021-01-06 13:34:49,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da20296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:34:49, skipping insertion in model container [2021-01-06 13:34:49,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:46" (2/3) ... [2021-01-06 13:34:49,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da20296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:34:49, skipping insertion in model container [2021-01-06 13:34:49,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:34:49" (3/3) ... [2021-01-06 13:34:49,067 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label28.c [2021-01-06 13:34:49,074 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 13:34:49,080 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 13:34:49,101 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 13:34:49,132 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 13:34:49,133 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 13:34:49,133 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 13:34:49,133 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 13:34:49,133 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 13:34:49,133 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 13:34:49,134 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 13:34:49,134 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 13:34:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2021-01-06 13:34:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 13:34:49,166 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:49,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:49,167 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:49,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:49,174 INFO L82 PathProgramCache]: Analyzing trace with hash 563919826, now seen corresponding path program 1 times [2021-01-06 13:34:49,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:49,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326468909] [2021-01-06 13:34:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:49,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326468909] [2021-01-06 13:34:49,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:49,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:34:49,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255740507] [2021-01-06 13:34:49,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:49,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:49,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:49,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:49,526 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 3 states. [2021-01-06 13:34:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:51,126 INFO L93 Difference]: Finished difference Result 769 states and 1360 transitions. [2021-01-06 13:34:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:51,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2021-01-06 13:34:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:51,158 INFO L225 Difference]: With dead ends: 769 [2021-01-06 13:34:51,158 INFO L226 Difference]: Without dead ends: 422 [2021-01-06 13:34:51,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-01-06 13:34:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2021-01-06 13:34:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2021-01-06 13:34:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2021-01-06 13:34:51,252 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 48 [2021-01-06 13:34:51,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:51,253 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2021-01-06 13:34:51,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2021-01-06 13:34:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 13:34:51,258 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:51,259 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 13:34:51,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 13:34:51,259 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:51,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:51,261 INFO L82 PathProgramCache]: Analyzing trace with hash -33137041, now seen corresponding path program 1 times [2021-01-06 13:34:51,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:51,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207378604] [2021-01-06 13:34:51,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:51,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207378604] [2021-01-06 13:34:51,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:51,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:34:51,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026435751] [2021-01-06 13:34:51,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:51,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:51,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:51,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:51,535 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand 3 states. [2021-01-06 13:34:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:52,936 INFO L93 Difference]: Finished difference Result 1199 states and 1832 transitions. [2021-01-06 13:34:52,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:52,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2021-01-06 13:34:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:52,943 INFO L225 Difference]: With dead ends: 1199 [2021-01-06 13:34:52,943 INFO L226 Difference]: Without dead ends: 789 [2021-01-06 13:34:52,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-01-06 13:34:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 787. [2021-01-06 13:34:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2021-01-06 13:34:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2021-01-06 13:34:52,985 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 114 [2021-01-06 13:34:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:52,985 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2021-01-06 13:34:52,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2021-01-06 13:34:52,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 13:34:52,991 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:52,991 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:52,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 13:34:52,992 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:52,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:52,993 INFO L82 PathProgramCache]: Analyzing trace with hash 151352741, now seen corresponding path program 1 times [2021-01-06 13:34:52,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:52,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756884297] [2021-01-06 13:34:52,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:53,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756884297] [2021-01-06 13:34:53,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:53,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:34:53,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462502082] [2021-01-06 13:34:53,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:53,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:53,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:53,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:53,220 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand 3 states. [2021-01-06 13:34:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:54,347 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2021-01-06 13:34:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:54,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2021-01-06 13:34:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:54,354 INFO L225 Difference]: With dead ends: 1941 [2021-01-06 13:34:54,355 INFO L226 Difference]: Without dead ends: 1156 [2021-01-06 13:34:54,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:54,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2021-01-06 13:34:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156. [2021-01-06 13:34:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2021-01-06 13:34:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2021-01-06 13:34:54,387 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 118 [2021-01-06 13:34:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:54,387 INFO L481 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2021-01-06 13:34:54,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2021-01-06 13:34:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 13:34:54,393 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:54,393 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 13:34:54,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 13:34:54,394 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:54,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:54,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1565625650, now seen corresponding path program 1 times [2021-01-06 13:34:54,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:54,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847522712] [2021-01-06 13:34:54,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:54,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847522712] [2021-01-06 13:34:54,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:54,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:54,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774320403] [2021-01-06 13:34:54,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:54,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:54,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:54,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:54,659 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand 3 states. [2021-01-06 13:34:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:55,755 INFO L93 Difference]: Finished difference Result 2877 states and 3705 transitions. [2021-01-06 13:34:55,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:55,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2021-01-06 13:34:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:55,767 INFO L225 Difference]: With dead ends: 2877 [2021-01-06 13:34:55,767 INFO L226 Difference]: Without dead ends: 1723 [2021-01-06 13:34:55,769 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2021-01-06 13:34:55,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1529. [2021-01-06 13:34:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1529 states. [2021-01-06 13:34:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1926 transitions. [2021-01-06 13:34:55,807 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 1926 transitions. Word has length 160 [2021-01-06 13:34:55,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:55,808 INFO L481 AbstractCegarLoop]: Abstraction has 1529 states and 1926 transitions. [2021-01-06 13:34:55,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1926 transitions. [2021-01-06 13:34:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2021-01-06 13:34:55,817 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:55,817 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:55,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 13:34:55,817 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:55,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:55,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1640701857, now seen corresponding path program 1 times [2021-01-06 13:34:55,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:55,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286294139] [2021-01-06 13:34:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-01-06 13:34:56,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286294139] [2021-01-06 13:34:56,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:56,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:56,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585049722] [2021-01-06 13:34:56,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:56,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:56,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:56,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:56,154 INFO L87 Difference]: Start difference. First operand 1529 states and 1926 transitions. Second operand 3 states. [2021-01-06 13:34:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:57,521 INFO L93 Difference]: Finished difference Result 3616 states and 4598 transitions. [2021-01-06 13:34:57,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:57,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2021-01-06 13:34:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:57,535 INFO L225 Difference]: With dead ends: 3616 [2021-01-06 13:34:57,535 INFO L226 Difference]: Without dead ends: 2089 [2021-01-06 13:34:57,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:57,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2021-01-06 13:34:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1896. [2021-01-06 13:34:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2021-01-06 13:34:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2365 transitions. [2021-01-06 13:34:57,588 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2365 transitions. Word has length 230 [2021-01-06 13:34:57,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:57,590 INFO L481 AbstractCegarLoop]: Abstraction has 1896 states and 2365 transitions. [2021-01-06 13:34:57,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2365 transitions. [2021-01-06 13:34:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2021-01-06 13:34:57,596 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:57,597 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:57,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 13:34:57,598 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2085401836, now seen corresponding path program 1 times [2021-01-06 13:34:57,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:57,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388741715] [2021-01-06 13:34:57,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-01-06 13:34:57,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388741715] [2021-01-06 13:34:57,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:57,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:34:57,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858904517] [2021-01-06 13:34:57,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:57,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:57,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:57,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:57,885 INFO L87 Difference]: Start difference. First operand 1896 states and 2365 transitions. Second operand 3 states. [2021-01-06 13:34:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:58,979 INFO L93 Difference]: Finished difference Result 4710 states and 5991 transitions. [2021-01-06 13:34:58,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:58,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2021-01-06 13:34:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:58,994 INFO L225 Difference]: With dead ends: 4710 [2021-01-06 13:34:58,994 INFO L226 Difference]: Without dead ends: 2816 [2021-01-06 13:34:58,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2021-01-06 13:34:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2815. [2021-01-06 13:34:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2021-01-06 13:34:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 3392 transitions. [2021-01-06 13:34:59,057 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 3392 transitions. Word has length 248 [2021-01-06 13:34:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:59,058 INFO L481 AbstractCegarLoop]: Abstraction has 2815 states and 3392 transitions. [2021-01-06 13:34:59,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 3392 transitions. [2021-01-06 13:34:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2021-01-06 13:34:59,063 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:59,063 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:59,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 13:34:59,064 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:59,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:59,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1319455466, now seen corresponding path program 1 times [2021-01-06 13:34:59,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:59,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923853151] [2021-01-06 13:34:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:59,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923853151] [2021-01-06 13:34:59,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:59,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:59,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842409] [2021-01-06 13:34:59,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:59,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:59,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:59,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:59,356 INFO L87 Difference]: Start difference. First operand 2815 states and 3392 transitions. Second operand 3 states. [2021-01-06 13:35:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:00,679 INFO L93 Difference]: Finished difference Result 6929 states and 8401 transitions. [2021-01-06 13:35:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:00,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2021-01-06 13:35:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:00,699 INFO L225 Difference]: With dead ends: 6929 [2021-01-06 13:35:00,699 INFO L226 Difference]: Without dead ends: 4116 [2021-01-06 13:35:00,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2021-01-06 13:35:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 4112. [2021-01-06 13:35:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4112 states. [2021-01-06 13:35:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 4910 transitions. [2021-01-06 13:35:00,814 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 4910 transitions. Word has length 257 [2021-01-06 13:35:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:00,814 INFO L481 AbstractCegarLoop]: Abstraction has 4112 states and 4910 transitions. [2021-01-06 13:35:00,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 4910 transitions. [2021-01-06 13:35:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2021-01-06 13:35:00,820 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:00,821 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:00,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 13:35:00,821 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:00,822 INFO L82 PathProgramCache]: Analyzing trace with hash 886178797, now seen corresponding path program 1 times [2021-01-06 13:35:00,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:00,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506088621] [2021-01-06 13:35:00,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:35:01,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506088621] [2021-01-06 13:35:01,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:01,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:01,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775307336] [2021-01-06 13:35:01,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:35:01,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:01,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:35:01,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:35:01,118 INFO L87 Difference]: Start difference. First operand 4112 states and 4910 transitions. Second operand 4 states. [2021-01-06 13:35:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:03,579 INFO L93 Difference]: Finished difference Result 12100 states and 14578 transitions. [2021-01-06 13:35:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:35:03,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2021-01-06 13:35:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:03,615 INFO L225 Difference]: With dead ends: 12100 [2021-01-06 13:35:03,616 INFO L226 Difference]: Without dead ends: 7990 [2021-01-06 13:35:03,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:35:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7990 states. [2021-01-06 13:35:03,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7990 to 7985. [2021-01-06 13:35:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7985 states. [2021-01-06 13:35:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7985 states to 7985 states and 9496 transitions. [2021-01-06 13:35:03,797 INFO L78 Accepts]: Start accepts. Automaton has 7985 states and 9496 transitions. Word has length 263 [2021-01-06 13:35:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:03,798 INFO L481 AbstractCegarLoop]: Abstraction has 7985 states and 9496 transitions. [2021-01-06 13:35:03,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:35:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 7985 states and 9496 transitions. [2021-01-06 13:35:03,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2021-01-06 13:35:03,805 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:03,805 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:03,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 13:35:03,806 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:03,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:03,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1947751424, now seen corresponding path program 1 times [2021-01-06 13:35:03,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:03,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109659257] [2021-01-06 13:35:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 144 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:35:04,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109659257] [2021-01-06 13:35:04,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485260475] [2021-01-06 13:35:04,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:04,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:35:04,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-01-06 13:35:05,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:35:05,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 13:35:05,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321160943] [2021-01-06 13:35:05,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:35:05,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:05,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:35:05,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:35:05,258 INFO L87 Difference]: Start difference. First operand 7985 states and 9496 transitions. Second operand 4 states. [2021-01-06 13:35:07,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:07,344 INFO L93 Difference]: Finished difference Result 21324 states and 25142 transitions. [2021-01-06 13:35:07,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:35:07,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2021-01-06 13:35:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:07,391 INFO L225 Difference]: With dead ends: 21324 [2021-01-06 13:35:07,392 INFO L226 Difference]: Without dead ends: 13709 [2021-01-06 13:35:07,402 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:35:07,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13709 states. [2021-01-06 13:35:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13709 to 11121. [2021-01-06 13:35:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11121 states. [2021-01-06 13:35:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11121 states to 11121 states and 13048 transitions. [2021-01-06 13:35:07,632 INFO L78 Accepts]: Start accepts. Automaton has 11121 states and 13048 transitions. Word has length 266 [2021-01-06 13:35:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:07,632 INFO L481 AbstractCegarLoop]: Abstraction has 11121 states and 13048 transitions. [2021-01-06 13:35:07,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:35:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 11121 states and 13048 transitions. [2021-01-06 13:35:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2021-01-06 13:35:07,640 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:07,641 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:07,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-06 13:35:07,856 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:07,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:07,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1546626242, now seen corresponding path program 1 times [2021-01-06 13:35:07,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:07,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309626843] [2021-01-06 13:35:07,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-01-06 13:35:08,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309626843] [2021-01-06 13:35:08,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:08,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:08,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952705146] [2021-01-06 13:35:08,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:08,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:08,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:08,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:08,066 INFO L87 Difference]: Start difference. First operand 11121 states and 13048 transitions. Second operand 3 states. [2021-01-06 13:35:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:09,314 INFO L93 Difference]: Finished difference Result 21870 states and 25706 transitions. [2021-01-06 13:35:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:09,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2021-01-06 13:35:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:09,340 INFO L225 Difference]: With dead ends: 21870 [2021-01-06 13:35:09,340 INFO L226 Difference]: Without dead ends: 11119 [2021-01-06 13:35:09,353 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11119 states. [2021-01-06 13:35:09,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11119 to 11119. [2021-01-06 13:35:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11119 states. [2021-01-06 13:35:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11119 states to 11119 states and 12716 transitions. [2021-01-06 13:35:09,535 INFO L78 Accepts]: Start accepts. Automaton has 11119 states and 12716 transitions. Word has length 278 [2021-01-06 13:35:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:09,536 INFO L481 AbstractCegarLoop]: Abstraction has 11119 states and 12716 transitions. [2021-01-06 13:35:09,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 11119 states and 12716 transitions. [2021-01-06 13:35:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2021-01-06 13:35:09,543 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:09,544 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 13:35:09,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 13:35:09,544 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:09,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:09,545 INFO L82 PathProgramCache]: Analyzing trace with hash 627435673, now seen corresponding path program 1 times [2021-01-06 13:35:09,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:09,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574707646] [2021-01-06 13:35:09,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:35:09,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574707646] [2021-01-06 13:35:09,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865700398] [2021-01-06 13:35:09,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:10,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 13:35:10,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:35:10,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:35:10,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:35:10,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92949630] [2021-01-06 13:35:10,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:10,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:10,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:10,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:35:10,519 INFO L87 Difference]: Start difference. First operand 11119 states and 12716 transitions. Second operand 3 states. [2021-01-06 13:35:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:11,823 INFO L93 Difference]: Finished difference Result 22803 states and 26118 transitions. [2021-01-06 13:35:11,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:11,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2021-01-06 13:35:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:11,849 INFO L225 Difference]: With dead ends: 22803 [2021-01-06 13:35:11,849 INFO L226 Difference]: Without dead ends: 12054 [2021-01-06 13:35:11,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:35:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12054 states. [2021-01-06 13:35:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12054 to 12045. [2021-01-06 13:35:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12045 states. [2021-01-06 13:35:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12045 states to 12045 states and 13747 transitions. [2021-01-06 13:35:12,059 INFO L78 Accepts]: Start accepts. Automaton has 12045 states and 13747 transitions. Word has length 281 [2021-01-06 13:35:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:12,060 INFO L481 AbstractCegarLoop]: Abstraction has 12045 states and 13747 transitions. [2021-01-06 13:35:12,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 12045 states and 13747 transitions. [2021-01-06 13:35:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2021-01-06 13:35:12,070 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:12,070 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 13:35:12,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:12,284 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:12,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:12,285 INFO L82 PathProgramCache]: Analyzing trace with hash 510288335, now seen corresponding path program 1 times [2021-01-06 13:35:12,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:12,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295522996] [2021-01-06 13:35:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-01-06 13:35:12,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295522996] [2021-01-06 13:35:12,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:12,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:12,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403351886] [2021-01-06 13:35:12,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:12,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:12,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:12,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:12,607 INFO L87 Difference]: Start difference. First operand 12045 states and 13747 transitions. Second operand 3 states. [2021-01-06 13:35:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:14,009 INFO L93 Difference]: Finished difference Result 26847 states and 30697 transitions. [2021-01-06 13:35:14,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:14,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2021-01-06 13:35:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:14,038 INFO L225 Difference]: With dead ends: 26847 [2021-01-06 13:35:14,039 INFO L226 Difference]: Without dead ends: 14988 [2021-01-06 13:35:14,053 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14988 states. [2021-01-06 13:35:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14988 to 13884. [2021-01-06 13:35:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13884 states. [2021-01-06 13:35:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13884 states to 13884 states and 15712 transitions. [2021-01-06 13:35:14,314 INFO L78 Accepts]: Start accepts. Automaton has 13884 states and 15712 transitions. Word has length 310 [2021-01-06 13:35:14,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:14,314 INFO L481 AbstractCegarLoop]: Abstraction has 13884 states and 15712 transitions. [2021-01-06 13:35:14,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 13884 states and 15712 transitions. [2021-01-06 13:35:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2021-01-06 13:35:14,330 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:14,330 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:14,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 13:35:14,331 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:14,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:14,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2040805826, now seen corresponding path program 1 times [2021-01-06 13:35:14,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:14,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986980713] [2021-01-06 13:35:14,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 242 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:35:14,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986980713] [2021-01-06 13:35:14,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458488072] [2021-01-06 13:35:14,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:15,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 13:35:15,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-01-06 13:35:15,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:35:15,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 13:35:15,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412364768] [2021-01-06 13:35:15,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:15,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:15,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:15,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:35:15,577 INFO L87 Difference]: Start difference. First operand 13884 states and 15712 transitions. Second operand 3 states. [2021-01-06 13:35:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:16,836 INFO L93 Difference]: Finished difference Result 29063 states and 32898 transitions. [2021-01-06 13:35:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:16,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2021-01-06 13:35:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:16,862 INFO L225 Difference]: With dead ends: 29063 [2021-01-06 13:35:16,862 INFO L226 Difference]: Without dead ends: 15181 [2021-01-06 13:35:16,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:35:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15181 states. [2021-01-06 13:35:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15181 to 14810. [2021-01-06 13:35:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14810 states. [2021-01-06 13:35:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14810 states to 14810 states and 16698 transitions. [2021-01-06 13:35:17,146 INFO L78 Accepts]: Start accepts. Automaton has 14810 states and 16698 transitions. Word has length 335 [2021-01-06 13:35:17,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:17,147 INFO L481 AbstractCegarLoop]: Abstraction has 14810 states and 16698 transitions. [2021-01-06 13:35:17,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 14810 states and 16698 transitions. [2021-01-06 13:35:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2021-01-06 13:35:17,163 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:17,164 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:17,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-06 13:35:17,378 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:17,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1448916129, now seen corresponding path program 1 times [2021-01-06 13:35:17,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:17,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928869125] [2021-01-06 13:35:17,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2021-01-06 13:35:17,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928869125] [2021-01-06 13:35:17,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:17,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:17,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072903891] [2021-01-06 13:35:17,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:17,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:17,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:17,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:17,652 INFO L87 Difference]: Start difference. First operand 14810 states and 16698 transitions. Second operand 3 states. [2021-01-06 13:35:18,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:18,834 INFO L93 Difference]: Finished difference Result 17388 states and 19601 transitions. [2021-01-06 13:35:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:18,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2021-01-06 13:35:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:18,860 INFO L225 Difference]: With dead ends: 17388 [2021-01-06 13:35:18,861 INFO L226 Difference]: Without dead ends: 17386 [2021-01-06 13:35:18,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:18,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2021-01-06 13:35:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 16282. [2021-01-06 13:35:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16282 states. [2021-01-06 13:35:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16282 states to 16282 states and 18402 transitions. [2021-01-06 13:35:19,103 INFO L78 Accepts]: Start accepts. Automaton has 16282 states and 18402 transitions. Word has length 344 [2021-01-06 13:35:19,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:19,104 INFO L481 AbstractCegarLoop]: Abstraction has 16282 states and 18402 transitions. [2021-01-06 13:35:19,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 16282 states and 18402 transitions. [2021-01-06 13:35:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2021-01-06 13:35:19,120 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:19,121 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:19,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 13:35:19,121 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:19,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:19,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1133150815, now seen corresponding path program 1 times [2021-01-06 13:35:19,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:19,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167823227] [2021-01-06 13:35:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 252 proven. 51 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-01-06 13:35:19,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167823227] [2021-01-06 13:35:19,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405947464] [2021-01-06 13:35:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:19,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 13:35:19,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-01-06 13:35:20,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:35:20,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:35:20,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398627518] [2021-01-06 13:35:20,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:20,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:20,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:20,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:35:20,324 INFO L87 Difference]: Start difference. First operand 16282 states and 18402 transitions. Second operand 3 states. [2021-01-06 13:35:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:21,458 INFO L93 Difference]: Finished difference Result 32380 states and 36608 transitions. [2021-01-06 13:35:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:21,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 356 [2021-01-06 13:35:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:21,487 INFO L225 Difference]: With dead ends: 32380 [2021-01-06 13:35:21,488 INFO L226 Difference]: Without dead ends: 16100 [2021-01-06 13:35:21,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:35:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16100 states. [2021-01-06 13:35:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16100 to 14994. [2021-01-06 13:35:21,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14994 states. [2021-01-06 13:35:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14994 states to 14994 states and 16870 transitions. [2021-01-06 13:35:21,788 INFO L78 Accepts]: Start accepts. Automaton has 14994 states and 16870 transitions. Word has length 356 [2021-01-06 13:35:21,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:21,789 INFO L481 AbstractCegarLoop]: Abstraction has 14994 states and 16870 transitions. [2021-01-06 13:35:21,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 14994 states and 16870 transitions. [2021-01-06 13:35:21,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2021-01-06 13:35:21,806 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:21,806 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2021-01-06 13:35:22,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:22,023 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:22,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash -84443467, now seen corresponding path program 1 times [2021-01-06 13:35:22,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:22,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721811127] [2021-01-06 13:35:22,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 281 proven. 58 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-01-06 13:35:22,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721811127] [2021-01-06 13:35:22,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408760663] [2021-01-06 13:35:22,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:22,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 13:35:22,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 202 proven. 137 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-01-06 13:35:23,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:35:23,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-01-06 13:35:23,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146445034] [2021-01-06 13:35:23,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 13:35:23,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:23,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 13:35:23,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:35:23,638 INFO L87 Difference]: Start difference. First operand 14994 states and 16870 transitions. Second operand 9 states. [2021-01-06 13:35:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:32,762 INFO L93 Difference]: Finished difference Result 38457 states and 43364 transitions. [2021-01-06 13:35:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 13:35:32,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 373 [2021-01-06 13:35:32,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:32,784 INFO L225 Difference]: With dead ends: 38457 [2021-01-06 13:35:32,784 INFO L226 Difference]: Without dead ends: 23097 [2021-01-06 13:35:32,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-01-06 13:35:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23097 states. [2021-01-06 13:35:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23097 to 16269. [2021-01-06 13:35:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16269 states. [2021-01-06 13:35:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16269 states to 16269 states and 17969 transitions. [2021-01-06 13:35:33,047 INFO L78 Accepts]: Start accepts. Automaton has 16269 states and 17969 transitions. Word has length 373 [2021-01-06 13:35:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:33,047 INFO L481 AbstractCegarLoop]: Abstraction has 16269 states and 17969 transitions. [2021-01-06 13:35:33,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 13:35:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 16269 states and 17969 transitions. [2021-01-06 13:35:33,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2021-01-06 13:35:33,060 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:33,060 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:33,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-06 13:35:33,275 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:33,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:33,276 INFO L82 PathProgramCache]: Analyzing trace with hash 732027564, now seen corresponding path program 1 times [2021-01-06 13:35:33,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:33,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347298945] [2021-01-06 13:35:33,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-01-06 13:35:33,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347298945] [2021-01-06 13:35:33,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:33,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:33,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817380904] [2021-01-06 13:35:33,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:33,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:33,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:33,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:33,529 INFO L87 Difference]: Start difference. First operand 16269 states and 17969 transitions. Second operand 3 states. [2021-01-06 13:35:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:35,015 INFO L93 Difference]: Finished difference Result 32172 states and 35564 transitions. [2021-01-06 13:35:35,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:35,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 379 [2021-01-06 13:35:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:35,029 INFO L225 Difference]: With dead ends: 32172 [2021-01-06 13:35:35,030 INFO L226 Difference]: Without dead ends: 16273 [2021-01-06 13:35:35,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16273 states. [2021-01-06 13:35:35,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16273 to 16268. [2021-01-06 13:35:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16268 states. [2021-01-06 13:35:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16268 states to 16268 states and 17870 transitions. [2021-01-06 13:35:35,248 INFO L78 Accepts]: Start accepts. Automaton has 16268 states and 17870 transitions. Word has length 379 [2021-01-06 13:35:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:35,249 INFO L481 AbstractCegarLoop]: Abstraction has 16268 states and 17870 transitions. [2021-01-06 13:35:35,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 16268 states and 17870 transitions. [2021-01-06 13:35:35,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2021-01-06 13:35:35,260 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:35,260 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:35,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 13:35:35,261 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:35,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:35,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1821887244, now seen corresponding path program 1 times [2021-01-06 13:35:35,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:35,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737453004] [2021-01-06 13:35:35,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-01-06 13:35:35,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737453004] [2021-01-06 13:35:35,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:35,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:35,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480717662] [2021-01-06 13:35:35,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:35,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:35,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:35,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:35,612 INFO L87 Difference]: Start difference. First operand 16268 states and 17870 transitions. Second operand 3 states. [2021-01-06 13:35:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:36,883 INFO L93 Difference]: Finished difference Result 32356 states and 35578 transitions. [2021-01-06 13:35:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:36,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 384 [2021-01-06 13:35:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:36,903 INFO L225 Difference]: With dead ends: 32356 [2021-01-06 13:35:36,904 INFO L226 Difference]: Without dead ends: 16458 [2021-01-06 13:35:36,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16458 states. [2021-01-06 13:35:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16458 to 16454. [2021-01-06 13:35:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16454 states. [2021-01-06 13:35:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 18067 transitions. [2021-01-06 13:35:37,212 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 18067 transitions. Word has length 384 [2021-01-06 13:35:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:37,212 INFO L481 AbstractCegarLoop]: Abstraction has 16454 states and 18067 transitions. [2021-01-06 13:35:37,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 18067 transitions. [2021-01-06 13:35:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2021-01-06 13:35:37,223 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:37,224 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:37,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 13:35:37,224 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:37,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:37,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1292080885, now seen corresponding path program 1 times [2021-01-06 13:35:37,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:37,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770318096] [2021-01-06 13:35:37,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 137 proven. 211 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-01-06 13:35:37,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770318096] [2021-01-06 13:35:37,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140783932] [2021-01-06 13:35:37,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:37,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:35:37,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-01-06 13:35:38,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:35:38,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:35:38,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640236267] [2021-01-06 13:35:38,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:38,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:38,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:38,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:35:38,418 INFO L87 Difference]: Start difference. First operand 16454 states and 18067 transitions. Second operand 3 states. [2021-01-06 13:35:39,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:39,868 INFO L93 Difference]: Finished difference Result 33662 states and 37021 transitions. [2021-01-06 13:35:39,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:39,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2021-01-06 13:35:39,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:39,885 INFO L225 Difference]: With dead ends: 33662 [2021-01-06 13:35:39,885 INFO L226 Difference]: Without dead ends: 17578 [2021-01-06 13:35:39,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:35:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17578 states. [2021-01-06 13:35:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17578 to 17006. [2021-01-06 13:35:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17006 states. [2021-01-06 13:35:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17006 states to 17006 states and 18680 transitions. [2021-01-06 13:35:40,082 INFO L78 Accepts]: Start accepts. Automaton has 17006 states and 18680 transitions. Word has length 393 [2021-01-06 13:35:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:40,082 INFO L481 AbstractCegarLoop]: Abstraction has 17006 states and 18680 transitions. [2021-01-06 13:35:40,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 17006 states and 18680 transitions. [2021-01-06 13:35:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2021-01-06 13:35:40,096 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:40,097 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2021-01-06 13:35:40,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:40,311 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:40,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:40,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1802628130, now seen corresponding path program 1 times [2021-01-06 13:35:40,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:40,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965360876] [2021-01-06 13:35:40,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 137 proven. 229 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-01-06 13:35:40,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965360876] [2021-01-06 13:35:40,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534857922] [2021-01-06 13:35:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:40,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 13:35:40,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 242 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:35:42,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:35:42,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-01-06 13:35:42,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008850955] [2021-01-06 13:35:42,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 13:35:42,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:42,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 13:35:42,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:35:42,015 INFO L87 Difference]: Start difference. First operand 17006 states and 18680 transitions. Second operand 9 states. [2021-01-06 13:35:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:50,235 INFO L93 Difference]: Finished difference Result 45990 states and 50486 transitions. [2021-01-06 13:35:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 13:35:50,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 415 [2021-01-06 13:35:50,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:50,276 INFO L225 Difference]: With dead ends: 45990 [2021-01-06 13:35:50,277 INFO L226 Difference]: Without dead ends: 29354 [2021-01-06 13:35:50,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2021-01-06 13:35:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29354 states. [2021-01-06 13:35:50,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29354 to 21058. [2021-01-06 13:35:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21058 states. [2021-01-06 13:35:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21058 states to 21058 states and 23087 transitions. [2021-01-06 13:35:50,647 INFO L78 Accepts]: Start accepts. Automaton has 21058 states and 23087 transitions. Word has length 415 [2021-01-06 13:35:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:50,647 INFO L481 AbstractCegarLoop]: Abstraction has 21058 states and 23087 transitions. [2021-01-06 13:35:50,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 13:35:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 21058 states and 23087 transitions. [2021-01-06 13:35:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2021-01-06 13:35:50,673 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:50,673 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:50,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:50,889 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:50,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:50,889 INFO L82 PathProgramCache]: Analyzing trace with hash 644046263, now seen corresponding path program 1 times [2021-01-06 13:35:50,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:50,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079595977] [2021-01-06 13:35:50,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 677 proven. 190 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2021-01-06 13:35:51,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079595977] [2021-01-06 13:35:51,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752761021] [2021-01-06 13:35:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:51,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:35:51,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 831 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-01-06 13:35:52,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:35:52,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 13:35:52,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502200609] [2021-01-06 13:35:52,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:52,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:52,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:52,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:35:52,518 INFO L87 Difference]: Start difference. First operand 21058 states and 23087 transitions. Second operand 3 states. [2021-01-06 13:35:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:54,035 INFO L93 Difference]: Finished difference Result 47091 states and 51639 transitions. [2021-01-06 13:35:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:54,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 538 [2021-01-06 13:35:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:54,062 INFO L225 Difference]: With dead ends: 47091 [2021-01-06 13:35:54,063 INFO L226 Difference]: Without dead ends: 26403 [2021-01-06 13:35:54,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:35:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26403 states. [2021-01-06 13:35:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26403 to 19958. [2021-01-06 13:35:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19958 states. [2021-01-06 13:35:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19958 states to 19958 states and 21845 transitions. [2021-01-06 13:35:54,293 INFO L78 Accepts]: Start accepts. Automaton has 19958 states and 21845 transitions. Word has length 538 [2021-01-06 13:35:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:54,294 INFO L481 AbstractCegarLoop]: Abstraction has 19958 states and 21845 transitions. [2021-01-06 13:35:54,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 19958 states and 21845 transitions. [2021-01-06 13:35:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2021-01-06 13:35:54,308 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:54,309 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:54,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-01-06 13:35:54,515 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash 762866496, now seen corresponding path program 1 times [2021-01-06 13:35:54,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:54,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264412067] [2021-01-06 13:35:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 183 proven. 406 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-01-06 13:35:55,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264412067] [2021-01-06 13:35:55,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428374420] [2021-01-06 13:35:55,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:55,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 13:35:55,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:56,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:35:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 235 proven. 452 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-01-06 13:35:56,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:35:56,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2021-01-06 13:35:56,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200036937] [2021-01-06 13:35:56,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 13:35:56,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:56,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 13:35:56,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:35:56,730 INFO L87 Difference]: Start difference. First operand 19958 states and 21845 transitions. Second operand 7 states. [2021-01-06 13:36:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:36:01,462 INFO L93 Difference]: Finished difference Result 53391 states and 58457 transitions. [2021-01-06 13:36:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 13:36:01,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 570 [2021-01-06 13:36:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:36:01,506 INFO L225 Difference]: With dead ends: 53391 [2021-01-06 13:36:01,506 INFO L226 Difference]: Without dead ends: 33803 [2021-01-06 13:36:01,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:36:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33803 states. [2021-01-06 13:36:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33803 to 23286. [2021-01-06 13:36:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23286 states. [2021-01-06 13:36:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23286 states to 23286 states and 25488 transitions. [2021-01-06 13:36:02,019 INFO L78 Accepts]: Start accepts. Automaton has 23286 states and 25488 transitions. Word has length 570 [2021-01-06 13:36:02,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:36:02,020 INFO L481 AbstractCegarLoop]: Abstraction has 23286 states and 25488 transitions. [2021-01-06 13:36:02,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 13:36:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 23286 states and 25488 transitions. [2021-01-06 13:36:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2021-01-06 13:36:02,043 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:36:02,043 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 13:36:02,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:36:02,257 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:36:02,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:36:02,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1960093662, now seen corresponding path program 1 times [2021-01-06 13:36:02,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:36:02,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378100892] [2021-01-06 13:36:02,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:36:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 711 proven. 190 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-01-06 13:36:03,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378100892] [2021-01-06 13:36:03,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636191571] [2021-01-06 13:36:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:36:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:03,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 13:36:03,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:36:04,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:36:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 867 proven. 46 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2021-01-06 13:36:04,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:36:04,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2021-01-06 13:36:04,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115897999] [2021-01-06 13:36:04,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 13:36:04,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:36:04,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 13:36:04,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-01-06 13:36:04,368 INFO L87 Difference]: Start difference. First operand 23286 states and 25488 transitions. Second operand 10 states. [2021-01-06 13:36:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:36:17,227 INFO L93 Difference]: Finished difference Result 64468 states and 70626 transitions. [2021-01-06 13:36:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 13:36:17,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 581 [2021-01-06 13:36:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:36:17,267 INFO L225 Difference]: With dead ends: 64468 [2021-01-06 13:36:17,267 INFO L226 Difference]: Without dead ends: 41552 [2021-01-06 13:36:17,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2021-01-06 13:36:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41552 states. [2021-01-06 13:36:17,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41552 to 20513. [2021-01-06 13:36:17,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20513 states. [2021-01-06 13:36:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20513 states to 20513 states and 22448 transitions. [2021-01-06 13:36:17,607 INFO L78 Accepts]: Start accepts. Automaton has 20513 states and 22448 transitions. Word has length 581 [2021-01-06 13:36:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:36:17,608 INFO L481 AbstractCegarLoop]: Abstraction has 20513 states and 22448 transitions. [2021-01-06 13:36:17,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 13:36:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 20513 states and 22448 transitions. [2021-01-06 13:36:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2021-01-06 13:36:17,627 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:36:17,627 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:36:17,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:36:17,841 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:36:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:36:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash 745598085, now seen corresponding path program 1 times [2021-01-06 13:36:17,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:36:17,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012525345] [2021-01-06 13:36:17,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:36:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1165 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2021-01-06 13:36:18,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012525345] [2021-01-06 13:36:18,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:36:18,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:36:18,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342579257] [2021-01-06 13:36:18,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:36:18,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:36:18,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:36:18,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:36:18,509 INFO L87 Difference]: Start difference. First operand 20513 states and 22448 transitions. Second operand 4 states. [2021-01-06 13:36:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:36:21,194 INFO L93 Difference]: Finished difference Result 52471 states and 57389 transitions. [2021-01-06 13:36:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:36:21,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 584 [2021-01-06 13:36:21,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:36:21,229 INFO L225 Difference]: With dead ends: 52471 [2021-01-06 13:36:21,229 INFO L226 Difference]: Without dead ends: 31406 [2021-01-06 13:36:21,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:36:21,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31406 states. [2021-01-06 13:36:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31406 to 23829. [2021-01-06 13:36:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23829 states. [2021-01-06 13:36:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23829 states to 23829 states and 26010 transitions. [2021-01-06 13:36:21,518 INFO L78 Accepts]: Start accepts. Automaton has 23829 states and 26010 transitions. Word has length 584 [2021-01-06 13:36:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:36:21,518 INFO L481 AbstractCegarLoop]: Abstraction has 23829 states and 26010 transitions. [2021-01-06 13:36:21,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:36:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 23829 states and 26010 transitions. [2021-01-06 13:36:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2021-01-06 13:36:21,534 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:36:21,535 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 13:36:21,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 13:36:21,535 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:36:21,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:36:21,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1983796039, now seen corresponding path program 1 times [2021-01-06 13:36:21,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:36:21,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834690602] [2021-01-06 13:36:21,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:36:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 844 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2021-01-06 13:36:22,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834690602] [2021-01-06 13:36:22,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:36:22,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:36:22,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304056020] [2021-01-06 13:36:22,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:36:22,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:36:22,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:36:22,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:36:22,255 INFO L87 Difference]: Start difference. First operand 23829 states and 26010 transitions. Second operand 3 states. [2021-01-06 13:36:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:36:24,181 INFO L93 Difference]: Finished difference Result 51532 states and 56242 transitions. [2021-01-06 13:36:24,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:36:24,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 626 [2021-01-06 13:36:24,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:36:24,224 INFO L225 Difference]: With dead ends: 51532 [2021-01-06 13:36:24,224 INFO L226 Difference]: Without dead ends: 28257 [2021-01-06 13:36:24,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:36:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28257 states. [2021-01-06 13:36:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28257 to 27505. [2021-01-06 13:36:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27505 states. [2021-01-06 13:36:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27505 states to 27505 states and 29777 transitions. [2021-01-06 13:36:24,554 INFO L78 Accepts]: Start accepts. Automaton has 27505 states and 29777 transitions. Word has length 626 [2021-01-06 13:36:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:36:24,554 INFO L481 AbstractCegarLoop]: Abstraction has 27505 states and 29777 transitions. [2021-01-06 13:36:24,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:36:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 27505 states and 29777 transitions. [2021-01-06 13:36:24,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2021-01-06 13:36:24,572 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:36:24,573 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:36:24,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 13:36:24,573 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:36:24,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:36:24,574 INFO L82 PathProgramCache]: Analyzing trace with hash -507844233, now seen corresponding path program 1 times [2021-01-06 13:36:24,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:36:24,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446514543] [2021-01-06 13:36:24,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:36:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 926 proven. 236 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2021-01-06 13:36:25,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446514543] [2021-01-06 13:36:25,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669465945] [2021-01-06 13:36:25,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:36:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:26,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 13:36:26,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:36:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 873 proven. 105 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2021-01-06 13:36:27,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:36:27,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2021-01-06 13:36:27,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160500884] [2021-01-06 13:36:27,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 13:36:27,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:36:27,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 13:36:27,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:36:27,165 INFO L87 Difference]: Start difference. First operand 27505 states and 29777 transitions. Second operand 8 states. [2021-01-06 13:36:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:36:36,886 INFO L93 Difference]: Finished difference Result 66796 states and 72219 transitions. [2021-01-06 13:36:36,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 13:36:36,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 690 [2021-01-06 13:36:36,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:36:36,921 INFO L225 Difference]: With dead ends: 66796 [2021-01-06 13:36:36,921 INFO L226 Difference]: Without dead ends: 39845 [2021-01-06 13:36:36,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-01-06 13:36:36,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39845 states. [2021-01-06 13:36:37,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39845 to 33395. [2021-01-06 13:36:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33395 states. [2021-01-06 13:36:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33395 states to 33395 states and 36080 transitions. [2021-01-06 13:36:37,337 INFO L78 Accepts]: Start accepts. Automaton has 33395 states and 36080 transitions. Word has length 690 [2021-01-06 13:36:37,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:36:37,338 INFO L481 AbstractCegarLoop]: Abstraction has 33395 states and 36080 transitions. [2021-01-06 13:36:37,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 13:36:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 33395 states and 36080 transitions. [2021-01-06 13:36:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2021-01-06 13:36:37,364 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:36:37,364 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:36:37,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-01-06 13:36:37,568 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:36:37,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:36:37,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1592903774, now seen corresponding path program 1 times [2021-01-06 13:36:37,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:36:37,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112777045] [2021-01-06 13:36:37,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:36:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 1273 proven. 64 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2021-01-06 13:36:38,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112777045] [2021-01-06 13:36:38,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158212815] [2021-01-06 13:36:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:36:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:39,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 13:36:39,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:36:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 1337 proven. 0 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2021-01-06 13:36:40,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:36:40,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:36:40,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615662806] [2021-01-06 13:36:40,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:36:40,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:36:40,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:36:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:36:40,294 INFO L87 Difference]: Start difference. First operand 33395 states and 36080 transitions. Second operand 3 states. [2021-01-06 13:36:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:36:41,905 INFO L93 Difference]: Finished difference Result 66981 states and 72312 transitions. [2021-01-06 13:36:41,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:36:41,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 760 [2021-01-06 13:36:41,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:36:41,944 INFO L225 Difference]: With dead ends: 66981 [2021-01-06 13:36:41,944 INFO L226 Difference]: Without dead ends: 35428 [2021-01-06 13:36:41,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:36:41,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35428 states. [2021-01-06 13:36:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35428 to 32471. [2021-01-06 13:36:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32471 states. [2021-01-06 13:36:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32471 states to 32471 states and 35006 transitions. [2021-01-06 13:36:42,377 INFO L78 Accepts]: Start accepts. Automaton has 32471 states and 35006 transitions. Word has length 760 [2021-01-06 13:36:42,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:36:42,378 INFO L481 AbstractCegarLoop]: Abstraction has 32471 states and 35006 transitions. [2021-01-06 13:36:42,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:36:42,378 INFO L276 IsEmpty]: Start isEmpty. Operand 32471 states and 35006 transitions. [2021-01-06 13:36:42,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2021-01-06 13:36:42,406 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:36:42,407 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 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, 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] [2021-01-06 13:36:42,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-06 13:36:42,622 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:36:42,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:36:42,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1793022811, now seen corresponding path program 1 times [2021-01-06 13:36:42,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:36:42,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591157736] [2021-01-06 13:36:42,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:36:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2134 backedges. 1427 proven. 0 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2021-01-06 13:36:43,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591157736] [2021-01-06 13:36:43,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:36:43,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:36:43,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333536132] [2021-01-06 13:36:43,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:36:43,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:36:43,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:36:43,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:36:43,383 INFO L87 Difference]: Start difference. First operand 32471 states and 35006 transitions. Second operand 3 states. [2021-01-06 13:36:45,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:36:45,422 INFO L93 Difference]: Finished difference Result 64579 states and 69610 transitions. [2021-01-06 13:36:45,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:36:45,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 785 [2021-01-06 13:36:45,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:36:45,457 INFO L225 Difference]: With dead ends: 64579 [2021-01-06 13:36:45,458 INFO L226 Difference]: Without dead ends: 33950 [2021-01-06 13:36:45,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:36:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33950 states. [2021-01-06 13:36:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33950 to 29159. [2021-01-06 13:36:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29159 states. [2021-01-06 13:36:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29159 states to 29159 states and 31438 transitions. [2021-01-06 13:36:45,879 INFO L78 Accepts]: Start accepts. Automaton has 29159 states and 31438 transitions. Word has length 785 [2021-01-06 13:36:45,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:36:45,879 INFO L481 AbstractCegarLoop]: Abstraction has 29159 states and 31438 transitions. [2021-01-06 13:36:45,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:36:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 29159 states and 31438 transitions. [2021-01-06 13:36:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2021-01-06 13:36:45,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:36:45,900 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:36:45,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 13:36:45,901 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:36:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:36:45,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1608454014, now seen corresponding path program 1 times [2021-01-06 13:36:45,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:36:45,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946057794] [2021-01-06 13:36:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:36:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 1298 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2021-01-06 13:36:46,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946057794] [2021-01-06 13:36:46,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:36:46,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:36:46,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721412228] [2021-01-06 13:36:46,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:36:46,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:36:46,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:36:46,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:36:46,673 INFO L87 Difference]: Start difference. First operand 29159 states and 31438 transitions. Second operand 3 states. [2021-01-06 13:36:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:36:48,397 INFO L93 Difference]: Finished difference Result 61271 states and 66110 transitions. [2021-01-06 13:36:48,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:36:48,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 790 [2021-01-06 13:36:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:36:48,431 INFO L225 Difference]: With dead ends: 61271 [2021-01-06 13:36:48,431 INFO L226 Difference]: Without dead ends: 32482 [2021-01-06 13:36:48,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:36:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32482 states. [2021-01-06 13:36:48,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32482 to 21977. [2021-01-06 13:36:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21977 states. [2021-01-06 13:36:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21977 states to 21977 states and 23621 transitions. [2021-01-06 13:36:48,759 INFO L78 Accepts]: Start accepts. Automaton has 21977 states and 23621 transitions. Word has length 790 [2021-01-06 13:36:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:36:48,759 INFO L481 AbstractCegarLoop]: Abstraction has 21977 states and 23621 transitions. [2021-01-06 13:36:48,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:36:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 21977 states and 23621 transitions. [2021-01-06 13:36:48,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2021-01-06 13:36:48,775 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:36:48,775 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, 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, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:36:48,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 13:36:48,776 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:36:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:36:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1647605771, now seen corresponding path program 1 times [2021-01-06 13:36:48,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:36:48,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129812465] [2021-01-06 13:36:48,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:36:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1849 proven. 25 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2021-01-06 13:36:50,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129812465] [2021-01-06 13:36:50,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263827167] [2021-01-06 13:36:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:36:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:50,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:36:50,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:36:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1874 proven. 0 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2021-01-06 13:36:51,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:36:51,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:36:51,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212729769] [2021-01-06 13:36:51,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:36:51,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:36:51,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:36:51,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:36:51,961 INFO L87 Difference]: Start difference. First operand 21977 states and 23621 transitions. Second operand 3 states. [2021-01-06 13:36:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:36:53,529 INFO L93 Difference]: Finished difference Result 45062 states and 48421 transitions. [2021-01-06 13:36:53,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:36:53,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 843 [2021-01-06 13:36:53,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:36:53,554 INFO L225 Difference]: With dead ends: 45062 [2021-01-06 13:36:53,554 INFO L226 Difference]: Without dead ends: 23823 [2021-01-06 13:36:53,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 842 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:36:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23823 states. [2021-01-06 13:36:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23823 to 17367. [2021-01-06 13:36:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17367 states. [2021-01-06 13:36:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17367 states to 17367 states and 18731 transitions. [2021-01-06 13:36:53,792 INFO L78 Accepts]: Start accepts. Automaton has 17367 states and 18731 transitions. Word has length 843 [2021-01-06 13:36:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:36:53,793 INFO L481 AbstractCegarLoop]: Abstraction has 17367 states and 18731 transitions. [2021-01-06 13:36:53,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:36:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 17367 states and 18731 transitions. [2021-01-06 13:36:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2021-01-06 13:36:53,805 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:36:53,805 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, 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, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-01-06 13:36:54,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:36:54,013 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:36:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:36:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1645547662, now seen corresponding path program 1 times [2021-01-06 13:36:54,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:36:54,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436250540] [2021-01-06 13:36:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:36:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2887 backedges. 1931 proven. 0 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked. [2021-01-06 13:36:54,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436250540] [2021-01-06 13:36:54,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:36:54,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:36:54,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272756552] [2021-01-06 13:36:54,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:36:54,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:36:54,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:36:54,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:36:54,954 INFO L87 Difference]: Start difference. First operand 17367 states and 18731 transitions. Second operand 3 states. [2021-01-06 13:36:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:36:56,566 INFO L93 Difference]: Finished difference Result 35476 states and 38284 transitions. [2021-01-06 13:36:56,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:36:56,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 860 [2021-01-06 13:36:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:36:56,584 INFO L225 Difference]: With dead ends: 35476 [2021-01-06 13:36:56,584 INFO L226 Difference]: Without dead ends: 18663 [2021-01-06 13:36:56,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:36:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18663 states. [2021-01-06 13:36:56,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18663 to 17367. [2021-01-06 13:36:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17367 states. [2021-01-06 13:36:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17367 states to 17367 states and 18734 transitions. [2021-01-06 13:36:56,774 INFO L78 Accepts]: Start accepts. Automaton has 17367 states and 18734 transitions. Word has length 860 [2021-01-06 13:36:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:36:56,774 INFO L481 AbstractCegarLoop]: Abstraction has 17367 states and 18734 transitions. [2021-01-06 13:36:56,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:36:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 17367 states and 18734 transitions. [2021-01-06 13:36:56,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2021-01-06 13:36:56,786 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:36:56,790 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2021-01-06 13:36:56,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 13:36:56,793 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:36:56,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:36:56,793 INFO L82 PathProgramCache]: Analyzing trace with hash -914206104, now seen corresponding path program 1 times [2021-01-06 13:36:56,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:36:56,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832331445] [2021-01-06 13:36:56,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:36:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2077 backedges. 1329 proven. 204 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2021-01-06 13:36:57,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832331445] [2021-01-06 13:36:57,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917564945] [2021-01-06 13:36:57,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:36:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:58,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 13:36:58,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:36:59,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:36:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2077 backedges. 1381 proven. 250 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2021-01-06 13:36:59,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:36:59,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2021-01-06 13:36:59,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187750133] [2021-01-06 13:36:59,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 13:36:59,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:36:59,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 13:36:59,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:36:59,914 INFO L87 Difference]: Start difference. First operand 17367 states and 18734 transitions. Second operand 7 states. [2021-01-06 13:37:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:37:06,135 INFO L93 Difference]: Finished difference Result 24008 states and 25780 transitions. [2021-01-06 13:37:06,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 13:37:06,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 875 [2021-01-06 13:37:06,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:37:06,157 INFO L225 Difference]: With dead ends: 24008 [2021-01-06 13:37:06,157 INFO L226 Difference]: Without dead ends: 24006 [2021-01-06 13:37:06,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 873 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:37:06,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24006 states. [2021-01-06 13:37:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24006 to 15519. [2021-01-06 13:37:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15519 states. [2021-01-06 13:37:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15519 states to 15519 states and 16707 transitions. [2021-01-06 13:37:06,371 INFO L78 Accepts]: Start accepts. Automaton has 15519 states and 16707 transitions. Word has length 875 [2021-01-06 13:37:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:37:06,372 INFO L481 AbstractCegarLoop]: Abstraction has 15519 states and 16707 transitions. [2021-01-06 13:37:06,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 13:37:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 15519 states and 16707 transitions. [2021-01-06 13:37:06,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2021-01-06 13:37:06,384 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:37:06,384 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:37:06,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:37:06,585 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:37:06,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:37:06,587 INFO L82 PathProgramCache]: Analyzing trace with hash 285246767, now seen corresponding path program 1 times [2021-01-06 13:37:06,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:37:06,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912156282] [2021-01-06 13:37:06,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:37:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2416 backedges. 1871 proven. 0 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2021-01-06 13:37:07,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912156282] [2021-01-06 13:37:07,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:37:07,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:37:07,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066085609] [2021-01-06 13:37:07,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:37:07,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:37:07,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:37:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:37:07,487 INFO L87 Difference]: Start difference. First operand 15519 states and 16707 transitions. Second operand 4 states. [2021-01-06 13:37:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:37:10,430 INFO L93 Difference]: Finished difference Result 36205 states and 38929 transitions. [2021-01-06 13:37:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:37:10,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 884 [2021-01-06 13:37:10,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:37:10,452 INFO L225 Difference]: With dead ends: 36205 [2021-01-06 13:37:10,452 INFO L226 Difference]: Without dead ends: 20504 [2021-01-06 13:37:10,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:37:10,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20504 states. [2021-01-06 13:37:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20504 to 15899. [2021-01-06 13:37:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15899 states. [2021-01-06 13:37:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15899 states to 15899 states and 17075 transitions. [2021-01-06 13:37:10,678 INFO L78 Accepts]: Start accepts. Automaton has 15899 states and 17075 transitions. Word has length 884 [2021-01-06 13:37:10,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:37:10,678 INFO L481 AbstractCegarLoop]: Abstraction has 15899 states and 17075 transitions. [2021-01-06 13:37:10,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:37:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 15899 states and 17075 transitions. [2021-01-06 13:37:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2021-01-06 13:37:10,689 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:37:10,689 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, 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, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-01-06 13:37:10,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 13:37:10,689 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:37:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:37:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash 617846151, now seen corresponding path program 1 times [2021-01-06 13:37:10,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:37:10,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785931833] [2021-01-06 13:37:10,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:37:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 2199 proven. 0 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2021-01-06 13:37:11,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785931833] [2021-01-06 13:37:11,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:37:11,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:37:11,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073409266] [2021-01-06 13:37:11,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:37:11,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:37:11,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:37:11,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:37:11,701 INFO L87 Difference]: Start difference. First operand 15899 states and 17075 transitions. Second operand 4 states. [2021-01-06 13:37:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:37:14,524 INFO L93 Difference]: Finished difference Result 34007 states and 36487 transitions. [2021-01-06 13:37:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:37:14,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 915 [2021-01-06 13:37:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:37:14,540 INFO L225 Difference]: With dead ends: 34007 [2021-01-06 13:37:14,541 INFO L226 Difference]: Without dead ends: 18110 [2021-01-06 13:37:14,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:37:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18110 states. [2021-01-06 13:37:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18110 to 15715. [2021-01-06 13:37:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15715 states. [2021-01-06 13:37:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15715 states to 15715 states and 16886 transitions. [2021-01-06 13:37:14,737 INFO L78 Accepts]: Start accepts. Automaton has 15715 states and 16886 transitions. Word has length 915 [2021-01-06 13:37:14,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:37:14,737 INFO L481 AbstractCegarLoop]: Abstraction has 15715 states and 16886 transitions. [2021-01-06 13:37:14,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:37:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 15715 states and 16886 transitions. [2021-01-06 13:37:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1476 [2021-01-06 13:37:14,754 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:37:14,755 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:37:14,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 13:37:14,756 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:37:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:37:14,756 INFO L82 PathProgramCache]: Analyzing trace with hash -274435446, now seen corresponding path program 1 times [2021-01-06 13:37:14,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:37:14,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685572108] [2021-01-06 13:37:14,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:37:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6445 backedges. 3630 proven. 277 refuted. 0 times theorem prover too weak. 2538 trivial. 0 not checked. [2021-01-06 13:37:18,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685572108] [2021-01-06 13:37:18,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742688910] [2021-01-06 13:37:18,108 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:37:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:18,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 1854 conjuncts, 21 conjunts are in the unsatisfiable core [2021-01-06 13:37:18,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:37:20,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:37:20,056 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 13:37:20,060 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 13:37:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6445 backedges. 4017 proven. 353 refuted. 0 times theorem prover too weak. 2075 trivial. 0 not checked. [2021-01-06 13:37:23,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:37:23,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 9 [2021-01-06 13:37:23,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070639009] [2021-01-06 13:37:23,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 13:37:23,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:37:23,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 13:37:23,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-01-06 13:37:23,712 INFO L87 Difference]: Start difference. First operand 15715 states and 16886 transitions. Second operand 10 states. [2021-01-06 13:37:34,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:37:34,799 INFO L93 Difference]: Finished difference Result 32425 states and 34764 transitions. [2021-01-06 13:37:34,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 13:37:34,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1475 [2021-01-06 13:37:34,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:37:34,822 INFO L225 Difference]: With dead ends: 32425 [2021-01-06 13:37:34,822 INFO L226 Difference]: Without dead ends: 16528 [2021-01-06 13:37:34,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1492 GetRequests, 1470 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2021-01-06 13:37:34,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16528 states. [2021-01-06 13:37:35,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16528 to 12947. [2021-01-06 13:37:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12947 states. [2021-01-06 13:37:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12947 states to 12947 states and 13781 transitions. [2021-01-06 13:37:35,079 INFO L78 Accepts]: Start accepts. Automaton has 12947 states and 13781 transitions. Word has length 1475 [2021-01-06 13:37:35,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:37:35,079 INFO L481 AbstractCegarLoop]: Abstraction has 12947 states and 13781 transitions. [2021-01-06 13:37:35,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 13:37:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand 12947 states and 13781 transitions. [2021-01-06 13:37:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1589 [2021-01-06 13:37:35,097 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:37:35,098 INFO L422 BasicCegarLoop]: trace histogram [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, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:37:35,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-01-06 13:37:35,299 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:37:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:37:35,301 INFO L82 PathProgramCache]: Analyzing trace with hash -688939330, now seen corresponding path program 1 times [2021-01-06 13:37:35,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:37:35,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735887754] [2021-01-06 13:37:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:37:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 4786 proven. 312 refuted. 0 times theorem prover too weak. 2538 trivial. 0 not checked. [2021-01-06 13:37:39,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735887754] [2021-01-06 13:37:39,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464580176] [2021-01-06 13:37:39,187 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:37:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:39,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 1991 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:37:39,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:37:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 4655 proven. 0 refuted. 0 times theorem prover too weak. 2981 trivial. 0 not checked. [2021-01-06 13:37:42,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:37:42,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2021-01-06 13:37:42,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650197345] [2021-01-06 13:37:42,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:37:42,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:37:42,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:37:42,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:37:42,844 INFO L87 Difference]: Start difference. First operand 12947 states and 13781 transitions. Second operand 4 states. [2021-01-06 13:37:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:37:44,828 INFO L93 Difference]: Finished difference Result 18492 states and 19594 transitions. [2021-01-06 13:37:44,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:37:44,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1588 [2021-01-06 13:37:44,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:37:44,830 INFO L225 Difference]: With dead ends: 18492 [2021-01-06 13:37:44,831 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 13:37:44,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1593 GetRequests, 1586 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:37:44,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 13:37:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 13:37:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 13:37:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 13:37:44,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1588 [2021-01-06 13:37:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:37:44,838 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 13:37:44,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:37:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 13:37:44,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 13:37:45,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:37:45,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 13:37:51,946 WARN L197 SmtUtils]: Spent 6.88 s on a formula simplification. DAG size of input: 1609 DAG size of output: 1297 [2021-01-06 13:37:57,843 WARN L197 SmtUtils]: Spent 5.89 s on a formula simplification. DAG size of input: 1606 DAG size of output: 1297 [2021-01-06 13:38:23,399 WARN L197 SmtUtils]: Spent 25.53 s on a formula simplification. DAG size of input: 1219 DAG size of output: 208