/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_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 03:43:12,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 03:43:12,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 03:43:12,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 03:43:12,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 03:43:12,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 03:43:12,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 03:43:12,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 03:43:12,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 03:43:12,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 03:43:12,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 03:43:12,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 03:43:12,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 03:43:12,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 03:43:12,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 03:43:12,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 03:43:12,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 03:43:12,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 03:43:12,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 03:43:12,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 03:43:12,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 03:43:12,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 03:43:12,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 03:43:12,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 03:43:12,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 03:43:12,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 03:43:12,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 03:43:12,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 03:43:12,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 03:43:12,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 03:43:12,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 03:43:12,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 03:43:12,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 03:43:12,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 03:43:12,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 03:43:12,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 03:43:12,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 03:43:12,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 03:43:12,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 03:43:12,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 03:43:12,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 03:43:12,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 03:43:12,906 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 03:43:12,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 03:43:12,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 03:43:12,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 03:43:12,909 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 03:43:12,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 03:43:12,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 03:43:12,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 03:43:12,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 03:43:12,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 03:43:12,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 03:43:12,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 03:43:12,910 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 03:43:12,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 03:43:12,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 03:43:12,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 03:43:12,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 03:43:12,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 03:43:12,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 03:43:12,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 03:43:12,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 03:43:12,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 03:43:12,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 03:43:12,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 03:43:12,913 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 03:43:12,913 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 03:43:13,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 03:43:13,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 03:43:13,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 03:43:13,346 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 03:43:13,346 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 03:43:13,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label45.c [2020-12-23 03:43:13,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6c9152ab2/d309439c249c4d838514f192d0e2605d/FLAGb50b5893d [2020-12-23 03:43:14,169 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 03:43:14,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label45.c [2020-12-23 03:43:14,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6c9152ab2/d309439c249c4d838514f192d0e2605d/FLAGb50b5893d [2020-12-23 03:43:14,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6c9152ab2/d309439c249c4d838514f192d0e2605d [2020-12-23 03:43:14,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 03:43:14,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 03:43:14,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 03:43:14,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 03:43:14,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 03:43:14,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:43:14" (1/1) ... [2020-12-23 03:43:14,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476ed08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:43:14, skipping insertion in model container [2020-12-23 03:43:14,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:43:14" (1/1) ... [2020-12-23 03:43:14,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 03:43:14,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 03:43:14,796 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_label45.c[4714,4727] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2020-12-23 03:43:15,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 03:43:15,144 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 03:43:15,195 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_label45.c[4714,4727] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2020-12-23 03:43:15,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 03:43:15,394 INFO L208 MainTranslator]: Completed translation [2020-12-23 03:43:15,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:43:15 WrapperNode [2020-12-23 03:43:15,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 03:43:15,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 03:43:15,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 03:43:15,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 03:43:15,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:43:15" (1/1) ... [2020-12-23 03:43:15,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:43:15" (1/1) ... [2020-12-23 03:43:15,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 03:43:15,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 03:43:15,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 03:43:15,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 03:43:15,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:43:15" (1/1) ... [2020-12-23 03:43:15,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:43:15" (1/1) ... [2020-12-23 03:43:15,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:43:15" (1/1) ... [2020-12-23 03:43:15,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:43:15" (1/1) ... [2020-12-23 03:43:15,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:43:15" (1/1) ... [2020-12-23 03:43:15,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:43:15" (1/1) ... [2020-12-23 03:43:15,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:43:15" (1/1) ... [2020-12-23 03:43:15,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 03:43:15,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 03:43:15,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 03:43:15,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 03:43:15,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:43:15" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 03:43:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 03:43:15,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 03:43:15,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 03:43:15,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 03:43:17,660 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 03:43:17,660 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 03:43:17,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:43:17 BoogieIcfgContainer [2020-12-23 03:43:17,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 03:43:17,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 03:43:17,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 03:43:17,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 03:43:17,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:43:14" (1/3) ... [2020-12-23 03:43:17,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cc80d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:43:17, skipping insertion in model container [2020-12-23 03:43:17,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:43:15" (2/3) ... [2020-12-23 03:43:17,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cc80d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:43:17, skipping insertion in model container [2020-12-23 03:43:17,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:43:17" (3/3) ... [2020-12-23 03:43:17,678 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label45.c [2020-12-23 03:43:17,685 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 03:43:17,691 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 03:43:17,714 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 03:43:17,750 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 03:43:17,750 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 03:43:17,750 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 03:43:17,750 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 03:43:17,751 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 03:43:17,751 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 03:43:17,751 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 03:43:17,751 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 03:43:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2020-12-23 03:43:17,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-23 03:43:17,778 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:17,779 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] [2020-12-23 03:43:17,780 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:17,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1317301102, now seen corresponding path program 1 times [2020-12-23 03:43:17,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:17,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054552965] [2020-12-23 03:43:17,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:43:18,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054552965] [2020-12-23 03:43:18,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:18,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:43:18,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804566690] [2020-12-23 03:43:18,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:43:18,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:18,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:43:18,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:18,130 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 3 states. [2020-12-23 03:43:19,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:19,519 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2020-12-23 03:43:19,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:43:19,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-12-23 03:43:19,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:19,543 INFO L225 Difference]: With dead ends: 761 [2020-12-23 03:43:19,543 INFO L226 Difference]: Without dead ends: 413 [2020-12-23 03:43:19,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-12-23 03:43:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2020-12-23 03:43:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-12-23 03:43:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2020-12-23 03:43:19,638 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 32 [2020-12-23 03:43:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:19,639 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2020-12-23 03:43:19,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:43:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2020-12-23 03:43:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 03:43:19,643 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:19,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:43:19,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 03:43:19,644 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:19,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:19,645 INFO L82 PathProgramCache]: Analyzing trace with hash -841882166, now seen corresponding path program 1 times [2020-12-23 03:43:19,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:19,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711802528] [2020-12-23 03:43:19,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:43:19,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711802528] [2020-12-23 03:43:19,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:19,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:43:19,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382661088] [2020-12-23 03:43:19,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:43:19,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:19,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:43:19,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:19,899 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand 3 states. [2020-12-23 03:43:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:21,083 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2020-12-23 03:43:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:43:21,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 03:43:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:21,093 INFO L225 Difference]: With dead ends: 1211 [2020-12-23 03:43:21,093 INFO L226 Difference]: Without dead ends: 800 [2020-12-23 03:43:21,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2020-12-23 03:43:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2020-12-23 03:43:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-12-23 03:43:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2020-12-23 03:43:21,158 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 100 [2020-12-23 03:43:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:21,159 INFO L481 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2020-12-23 03:43:21,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:43:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2020-12-23 03:43:21,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 03:43:21,163 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:21,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:43:21,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 03:43:21,164 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1213530036, now seen corresponding path program 1 times [2020-12-23 03:43:21,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:21,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247505972] [2020-12-23 03:43:21,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:43:21,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247505972] [2020-12-23 03:43:21,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:21,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:43:21,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351455249] [2020-12-23 03:43:21,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:43:21,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:21,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:43:21,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:43:21,457 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand 4 states. [2020-12-23 03:43:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:23,604 INFO L93 Difference]: Finished difference Result 2505 states and 3428 transitions. [2020-12-23 03:43:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:43:23,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-23 03:43:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:23,620 INFO L225 Difference]: With dead ends: 2505 [2020-12-23 03:43:23,620 INFO L226 Difference]: Without dead ends: 1718 [2020-12-23 03:43:23,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 03:43:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2020-12-23 03:43:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714. [2020-12-23 03:43:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2020-12-23 03:43:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions. [2020-12-23 03:43:23,682 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 101 [2020-12-23 03:43:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:23,682 INFO L481 AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions. [2020-12-23 03:43:23,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:43:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions. [2020-12-23 03:43:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-23 03:43:23,690 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:23,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:43:23,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 03:43:23,691 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:23,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:23,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1662627737, now seen corresponding path program 1 times [2020-12-23 03:43:23,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:23,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806966766] [2020-12-23 03:43:23,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:43:23,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806966766] [2020-12-23 03:43:23,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:23,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:43:23,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967510755] [2020-12-23 03:43:23,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:43:23,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:23,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:43:23,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:23,925 INFO L87 Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand 3 states. [2020-12-23 03:43:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:25,039 INFO L93 Difference]: Finished difference Result 4005 states and 5048 transitions. [2020-12-23 03:43:25,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:43:25,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2020-12-23 03:43:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:25,052 INFO L225 Difference]: With dead ends: 4005 [2020-12-23 03:43:25,052 INFO L226 Difference]: Without dead ends: 2477 [2020-12-23 03:43:25,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2020-12-23 03:43:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2474. [2020-12-23 03:43:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2020-12-23 03:43:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3044 transitions. [2020-12-23 03:43:25,113 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3044 transitions. Word has length 159 [2020-12-23 03:43:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:25,114 INFO L481 AbstractCegarLoop]: Abstraction has 2474 states and 3044 transitions. [2020-12-23 03:43:25,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:43:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3044 transitions. [2020-12-23 03:43:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-12-23 03:43:25,119 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:25,120 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 03:43:25,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 03:43:25,120 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:25,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:25,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1525135302, now seen corresponding path program 1 times [2020-12-23 03:43:25,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:25,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267151644] [2020-12-23 03:43:25,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:43:25,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267151644] [2020-12-23 03:43:25,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:25,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:43:25,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970533249] [2020-12-23 03:43:25,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:43:25,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:25,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:43:25,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:25,358 INFO L87 Difference]: Start difference. First operand 2474 states and 3044 transitions. Second operand 3 states. [2020-12-23 03:43:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:26,507 INFO L93 Difference]: Finished difference Result 5885 states and 7350 transitions. [2020-12-23 03:43:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:43:26,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-12-23 03:43:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:26,527 INFO L225 Difference]: With dead ends: 5885 [2020-12-23 03:43:26,528 INFO L226 Difference]: Without dead ends: 3597 [2020-12-23 03:43:26,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2020-12-23 03:43:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3397. [2020-12-23 03:43:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3397 states. [2020-12-23 03:43:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4111 transitions. [2020-12-23 03:43:26,648 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4111 transitions. Word has length 212 [2020-12-23 03:43:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:26,649 INFO L481 AbstractCegarLoop]: Abstraction has 3397 states and 4111 transitions. [2020-12-23 03:43:26,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:43:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4111 transitions. [2020-12-23 03:43:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-12-23 03:43:26,653 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:26,654 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 03:43:26,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 03:43:26,654 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:26,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash -850432560, now seen corresponding path program 1 times [2020-12-23 03:43:26,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:26,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146235729] [2020-12-23 03:43:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-23 03:43:26,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146235729] [2020-12-23 03:43:26,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:26,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:43:26,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673152733] [2020-12-23 03:43:26,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:43:26,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:43:26,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:26,920 INFO L87 Difference]: Start difference. First operand 3397 states and 4111 transitions. Second operand 3 states. [2020-12-23 03:43:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:28,055 INFO L93 Difference]: Finished difference Result 7359 states and 8963 transitions. [2020-12-23 03:43:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:43:28,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2020-12-23 03:43:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:28,083 INFO L225 Difference]: With dead ends: 7359 [2020-12-23 03:43:28,083 INFO L226 Difference]: Without dead ends: 3964 [2020-12-23 03:43:28,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2020-12-23 03:43:28,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 3949. [2020-12-23 03:43:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3949 states. [2020-12-23 03:43:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 4777 transitions. [2020-12-23 03:43:28,175 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 4777 transitions. Word has length 213 [2020-12-23 03:43:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:28,176 INFO L481 AbstractCegarLoop]: Abstraction has 3949 states and 4777 transitions. [2020-12-23 03:43:28,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:43:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 4777 transitions. [2020-12-23 03:43:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-12-23 03:43:28,179 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:28,180 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:43:28,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 03:43:28,180 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:28,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:28,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1355790433, now seen corresponding path program 1 times [2020-12-23 03:43:28,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:28,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042644469] [2020-12-23 03:43:28,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-23 03:43:28,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042644469] [2020-12-23 03:43:28,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:28,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:43:28,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648362325] [2020-12-23 03:43:28,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:43:28,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:28,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:43:28,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:28,335 INFO L87 Difference]: Start difference. First operand 3949 states and 4777 transitions. Second operand 3 states. [2020-12-23 03:43:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:29,723 INFO L93 Difference]: Finished difference Result 8827 states and 10787 transitions. [2020-12-23 03:43:29,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:43:29,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2020-12-23 03:43:29,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:29,747 INFO L225 Difference]: With dead ends: 8827 [2020-12-23 03:43:29,747 INFO L226 Difference]: Without dead ends: 4880 [2020-12-23 03:43:29,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2020-12-23 03:43:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4869. [2020-12-23 03:43:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4869 states. [2020-12-23 03:43:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 5817 transitions. [2020-12-23 03:43:29,850 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 5817 transitions. Word has length 214 [2020-12-23 03:43:29,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:29,850 INFO L481 AbstractCegarLoop]: Abstraction has 4869 states and 5817 transitions. [2020-12-23 03:43:29,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:43:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 5817 transitions. [2020-12-23 03:43:29,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-12-23 03:43:29,855 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:29,855 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:43:29,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 03:43:29,855 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:29,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:29,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1305427345, now seen corresponding path program 1 times [2020-12-23 03:43:29,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:29,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938937374] [2020-12-23 03:43:29,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:43:30,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938937374] [2020-12-23 03:43:30,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:30,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 03:43:30,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987925210] [2020-12-23 03:43:30,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:43:30,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:30,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:43:30,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:43:30,170 INFO L87 Difference]: Start difference. First operand 4869 states and 5817 transitions. Second operand 4 states. [2020-12-23 03:43:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:32,183 INFO L93 Difference]: Finished difference Result 15489 states and 18737 transitions. [2020-12-23 03:43:32,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:43:32,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2020-12-23 03:43:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:32,234 INFO L225 Difference]: With dead ends: 15489 [2020-12-23 03:43:32,234 INFO L226 Difference]: Without dead ends: 10622 [2020-12-23 03:43:32,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:43:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10622 states. [2020-12-23 03:43:32,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10622 to 10248. [2020-12-23 03:43:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10248 states. [2020-12-23 03:43:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10248 states to 10248 states and 12038 transitions. [2020-12-23 03:43:32,438 INFO L78 Accepts]: Start accepts. Automaton has 10248 states and 12038 transitions. Word has length 234 [2020-12-23 03:43:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:32,439 INFO L481 AbstractCegarLoop]: Abstraction has 10248 states and 12038 transitions. [2020-12-23 03:43:32,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:43:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 10248 states and 12038 transitions. [2020-12-23 03:43:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-12-23 03:43:32,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:32,445 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 03:43:32,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 03:43:32,445 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:32,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1724103242, now seen corresponding path program 1 times [2020-12-23 03:43:32,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:32,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517198512] [2020-12-23 03:43:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:43:32,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517198512] [2020-12-23 03:43:32,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:32,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 03:43:32,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708182789] [2020-12-23 03:43:32,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:43:32,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:32,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:43:32,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:43:32,747 INFO L87 Difference]: Start difference. First operand 10248 states and 12038 transitions. Second operand 4 states. [2020-12-23 03:43:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:35,009 INFO L93 Difference]: Finished difference Result 25302 states and 30140 transitions. [2020-12-23 03:43:35,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:43:35,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2020-12-23 03:43:35,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:35,049 INFO L225 Difference]: With dead ends: 25302 [2020-12-23 03:43:35,050 INFO L226 Difference]: Without dead ends: 15056 [2020-12-23 03:43:35,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:43:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15056 states. [2020-12-23 03:43:35,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15056 to 14673. [2020-12-23 03:43:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14673 states. [2020-12-23 03:43:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14673 states to 14673 states and 17326 transitions. [2020-12-23 03:43:35,290 INFO L78 Accepts]: Start accepts. Automaton has 14673 states and 17326 transitions. Word has length 244 [2020-12-23 03:43:35,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:35,291 INFO L481 AbstractCegarLoop]: Abstraction has 14673 states and 17326 transitions. [2020-12-23 03:43:35,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:43:35,291 INFO L276 IsEmpty]: Start isEmpty. Operand 14673 states and 17326 transitions. [2020-12-23 03:43:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-12-23 03:43:35,296 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:35,297 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 03:43:35,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 03:43:35,297 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:35,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash -162270422, now seen corresponding path program 1 times [2020-12-23 03:43:35,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:35,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142648745] [2020-12-23 03:43:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 03:43:35,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142648745] [2020-12-23 03:43:35,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:35,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:43:35,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918548023] [2020-12-23 03:43:35,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:43:35,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:35,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:43:35,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:35,555 INFO L87 Difference]: Start difference. First operand 14673 states and 17326 transitions. Second operand 3 states. [2020-12-23 03:43:36,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:36,972 INFO L93 Difference]: Finished difference Result 34863 states and 41368 transitions. [2020-12-23 03:43:36,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:43:36,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2020-12-23 03:43:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:37,012 INFO L225 Difference]: With dead ends: 34863 [2020-12-23 03:43:37,013 INFO L226 Difference]: Without dead ends: 20192 [2020-12-23 03:43:37,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20192 states. [2020-12-23 03:43:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20192 to 19084. [2020-12-23 03:43:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19084 states. [2020-12-23 03:43:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19084 states to 19084 states and 22218 transitions. [2020-12-23 03:43:37,348 INFO L78 Accepts]: Start accepts. Automaton has 19084 states and 22218 transitions. Word has length 246 [2020-12-23 03:43:37,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:37,349 INFO L481 AbstractCegarLoop]: Abstraction has 19084 states and 22218 transitions. [2020-12-23 03:43:37,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:43:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 19084 states and 22218 transitions. [2020-12-23 03:43:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2020-12-23 03:43:37,355 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:37,356 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:43:37,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 03:43:37,356 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:37,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash 712794243, now seen corresponding path program 1 times [2020-12-23 03:43:37,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:37,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592088073] [2020-12-23 03:43:37,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-12-23 03:43:37,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592088073] [2020-12-23 03:43:37,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:37,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:43:37,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347484465] [2020-12-23 03:43:37,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:43:37,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:37,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:43:37,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:37,529 INFO L87 Difference]: Start difference. First operand 19084 states and 22218 transitions. Second operand 3 states. [2020-12-23 03:43:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:38,999 INFO L93 Difference]: Finished difference Result 38178 states and 44458 transitions. [2020-12-23 03:43:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:43:38,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2020-12-23 03:43:39,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:39,028 INFO L225 Difference]: With dead ends: 38178 [2020-12-23 03:43:39,029 INFO L226 Difference]: Without dead ends: 19096 [2020-12-23 03:43:39,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19096 states. [2020-12-23 03:43:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19096 to 18899. [2020-12-23 03:43:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18899 states. [2020-12-23 03:43:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18899 states to 18899 states and 21507 transitions. [2020-12-23 03:43:39,430 INFO L78 Accepts]: Start accepts. Automaton has 18899 states and 21507 transitions. Word has length 251 [2020-12-23 03:43:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:39,431 INFO L481 AbstractCegarLoop]: Abstraction has 18899 states and 21507 transitions. [2020-12-23 03:43:39,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:43:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 18899 states and 21507 transitions. [2020-12-23 03:43:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-12-23 03:43:39,438 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:39,438 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 03:43:39,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 03:43:39,439 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:39,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:39,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1932798442, now seen corresponding path program 1 times [2020-12-23 03:43:39,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:39,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968278355] [2020-12-23 03:43:39,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:43:39,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968278355] [2020-12-23 03:43:39,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:39,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:43:39,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578569048] [2020-12-23 03:43:39,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:43:39,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:39,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:43:39,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:43:39,843 INFO L87 Difference]: Start difference. First operand 18899 states and 21507 transitions. Second operand 4 states. [2020-12-23 03:43:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:41,753 INFO L93 Difference]: Finished difference Result 34994 states and 39871 transitions. [2020-12-23 03:43:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:43:41,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2020-12-23 03:43:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:41,791 INFO L225 Difference]: With dead ends: 34994 [2020-12-23 03:43:41,792 INFO L226 Difference]: Without dead ends: 15545 [2020-12-23 03:43:41,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:43:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15545 states. [2020-12-23 03:43:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15545 to 12036. [2020-12-23 03:43:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12036 states. [2020-12-23 03:43:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12036 states to 12036 states and 13340 transitions. [2020-12-23 03:43:42,011 INFO L78 Accepts]: Start accepts. Automaton has 12036 states and 13340 transitions. Word has length 265 [2020-12-23 03:43:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:42,011 INFO L481 AbstractCegarLoop]: Abstraction has 12036 states and 13340 transitions. [2020-12-23 03:43:42,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:43:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 12036 states and 13340 transitions. [2020-12-23 03:43:42,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2020-12-23 03:43:42,020 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:42,020 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:43:42,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 03:43:42,021 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:42,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:42,021 INFO L82 PathProgramCache]: Analyzing trace with hash 452894645, now seen corresponding path program 1 times [2020-12-23 03:43:42,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:42,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046580756] [2020-12-23 03:43:42,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2020-12-23 03:43:42,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046580756] [2020-12-23 03:43:42,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:42,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:43:42,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420975913] [2020-12-23 03:43:42,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:43:42,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:42,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:43:42,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:42,283 INFO L87 Difference]: Start difference. First operand 12036 states and 13340 transitions. Second operand 3 states. [2020-12-23 03:43:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:43,445 INFO L93 Difference]: Finished difference Result 26093 states and 28925 transitions. [2020-12-23 03:43:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:43:43,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2020-12-23 03:43:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:43,467 INFO L225 Difference]: With dead ends: 26093 [2020-12-23 03:43:43,467 INFO L226 Difference]: Without dead ends: 14059 [2020-12-23 03:43:43,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:43:43,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14059 states. [2020-12-23 03:43:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14059 to 9638. [2020-12-23 03:43:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9638 states. [2020-12-23 03:43:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 10712 transitions. [2020-12-23 03:43:43,630 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 10712 transitions. Word has length 299 [2020-12-23 03:43:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:43,631 INFO L481 AbstractCegarLoop]: Abstraction has 9638 states and 10712 transitions. [2020-12-23 03:43:43,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:43:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 10712 transitions. [2020-12-23 03:43:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2020-12-23 03:43:43,638 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:43,639 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:43:43,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 03:43:43,639 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:43,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:43,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2016302327, now seen corresponding path program 1 times [2020-12-23 03:43:43,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:43,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783689908] [2020-12-23 03:43:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-12-23 03:43:43,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783689908] [2020-12-23 03:43:43,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:43,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 03:43:43,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377403913] [2020-12-23 03:43:43,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:43:43,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:43,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:43:43,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:43:43,976 INFO L87 Difference]: Start difference. First operand 9638 states and 10712 transitions. Second operand 4 states. [2020-12-23 03:43:46,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:46,355 INFO L93 Difference]: Finished difference Result 25930 states and 28775 transitions. [2020-12-23 03:43:46,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:43:46,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2020-12-23 03:43:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:46,374 INFO L225 Difference]: With dead ends: 25930 [2020-12-23 03:43:46,375 INFO L226 Difference]: Without dead ends: 16110 [2020-12-23 03:43:46,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:43:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16110 states. [2020-12-23 03:43:46,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16110 to 14073. [2020-12-23 03:43:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14073 states. [2020-12-23 03:43:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14073 states to 14073 states and 15555 transitions. [2020-12-23 03:43:46,559 INFO L78 Accepts]: Start accepts. Automaton has 14073 states and 15555 transitions. Word has length 319 [2020-12-23 03:43:46,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:46,560 INFO L481 AbstractCegarLoop]: Abstraction has 14073 states and 15555 transitions. [2020-12-23 03:43:46,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:43:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 14073 states and 15555 transitions. [2020-12-23 03:43:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2020-12-23 03:43:46,569 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:46,569 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 03:43:46,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 03:43:46,570 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:46,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:46,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1937622691, now seen corresponding path program 1 times [2020-12-23 03:43:46,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:46,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769843555] [2020-12-23 03:43:46,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 59 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:43:46,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769843555] [2020-12-23 03:43:46,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223117423] [2020-12-23 03:43:46,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:43:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:47,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 03:43:47,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:43:47,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 03:43:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 59 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:43:47,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 03:43:47,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2020-12-23 03:43:47,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404707998] [2020-12-23 03:43:47,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 03:43:47,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:47,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 03:43:47,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 03:43:47,917 INFO L87 Difference]: Start difference. First operand 14073 states and 15555 transitions. Second operand 7 states. [2020-12-23 03:43:52,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:52,227 INFO L93 Difference]: Finished difference Result 25513 states and 28147 transitions. [2020-12-23 03:43:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 03:43:52,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 330 [2020-12-23 03:43:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:52,295 INFO L225 Difference]: With dead ends: 25513 [2020-12-23 03:43:52,295 INFO L226 Difference]: Without dead ends: 25511 [2020-12-23 03:43:52,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 03:43:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25511 states. [2020-12-23 03:43:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25511 to 23667. [2020-12-23 03:43:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23667 states. [2020-12-23 03:43:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23667 states to 23667 states and 26163 transitions. [2020-12-23 03:43:52,813 INFO L78 Accepts]: Start accepts. Automaton has 23667 states and 26163 transitions. Word has length 330 [2020-12-23 03:43:52,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:52,814 INFO L481 AbstractCegarLoop]: Abstraction has 23667 states and 26163 transitions. [2020-12-23 03:43:52,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 03:43:52,815 INFO L276 IsEmpty]: Start isEmpty. Operand 23667 states and 26163 transitions. [2020-12-23 03:43:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2020-12-23 03:43:52,837 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:52,837 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:43:53,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 03:43:53,052 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash 506127583, now seen corresponding path program 1 times [2020-12-23 03:43:53,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:53,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547239506] [2020-12-23 03:43:53,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-23 03:43:53,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547239506] [2020-12-23 03:43:53,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:43:53,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:43:53,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839832832] [2020-12-23 03:43:53,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:43:53,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:53,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:43:53,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:43:53,570 INFO L87 Difference]: Start difference. First operand 23667 states and 26163 transitions. Second operand 4 states. [2020-12-23 03:43:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:43:55,699 INFO L93 Difference]: Finished difference Result 57297 states and 63378 transitions. [2020-12-23 03:43:55,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:43:55,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 389 [2020-12-23 03:43:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:43:55,741 INFO L225 Difference]: With dead ends: 57297 [2020-12-23 03:43:55,742 INFO L226 Difference]: Without dead ends: 33632 [2020-12-23 03:43:55,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:43:55,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33632 states. [2020-12-23 03:43:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33632 to 30671. [2020-12-23 03:43:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30671 states. [2020-12-23 03:43:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30671 states to 30671 states and 33974 transitions. [2020-12-23 03:43:56,339 INFO L78 Accepts]: Start accepts. Automaton has 30671 states and 33974 transitions. Word has length 389 [2020-12-23 03:43:56,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:43:56,340 INFO L481 AbstractCegarLoop]: Abstraction has 30671 states and 33974 transitions. [2020-12-23 03:43:56,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:43:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 30671 states and 33974 transitions. [2020-12-23 03:43:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2020-12-23 03:43:56,373 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:43:56,374 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:43:56,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 03:43:56,374 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:43:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:43:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash -2057975951, now seen corresponding path program 1 times [2020-12-23 03:43:56,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:43:56,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965231227] [2020-12-23 03:43:56,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:43:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 89 proven. 226 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-12-23 03:43:56,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965231227] [2020-12-23 03:43:56,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213767213] [2020-12-23 03:43:56,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:43:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:43:57,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 03:43:57,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:43:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-23 03:43:57,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 03:43:57,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-12-23 03:43:57,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254600609] [2020-12-23 03:43:57,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:43:57,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:43:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:43:57,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 03:43:57,709 INFO L87 Difference]: Start difference. First operand 30671 states and 33974 transitions. Second operand 4 states. [2020-12-23 03:44:00,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:44:00,172 INFO L93 Difference]: Finished difference Result 71104 states and 78918 transitions. [2020-12-23 03:44:00,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:44:00,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 430 [2020-12-23 03:44:00,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:44:00,215 INFO L225 Difference]: With dead ends: 71104 [2020-12-23 03:44:00,215 INFO L226 Difference]: Without dead ends: 40803 [2020-12-23 03:44:00,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 03:44:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40803 states. [2020-12-23 03:44:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40803 to 37486. [2020-12-23 03:44:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37486 states. [2020-12-23 03:44:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37486 states to 37486 states and 41339 transitions. [2020-12-23 03:44:01,015 INFO L78 Accepts]: Start accepts. Automaton has 37486 states and 41339 transitions. Word has length 430 [2020-12-23 03:44:01,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:44:01,015 INFO L481 AbstractCegarLoop]: Abstraction has 37486 states and 41339 transitions. [2020-12-23 03:44:01,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:44:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 37486 states and 41339 transitions. [2020-12-23 03:44:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2020-12-23 03:44:01,048 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:44:01,049 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:44:01,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 03:44:01,264 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:44:01,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:44:01,266 INFO L82 PathProgramCache]: Analyzing trace with hash -97616178, now seen corresponding path program 1 times [2020-12-23 03:44:01,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:44:01,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532255771] [2020-12-23 03:44:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:44:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2020-12-23 03:44:01,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532255771] [2020-12-23 03:44:01,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:44:01,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:44:01,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109249960] [2020-12-23 03:44:01,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:44:01,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:44:01,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:44:01,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:44:01,898 INFO L87 Difference]: Start difference. First operand 37486 states and 41339 transitions. Second operand 4 states. [2020-12-23 03:44:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:44:03,933 INFO L93 Difference]: Finished difference Result 73680 states and 81104 transitions. [2020-12-23 03:44:03,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:44:03,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 448 [2020-12-23 03:44:03,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:44:03,973 INFO L225 Difference]: With dead ends: 73680 [2020-12-23 03:44:03,973 INFO L226 Difference]: Without dead ends: 38042 [2020-12-23 03:44:03,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:44:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38042 states. [2020-12-23 03:44:04,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38042 to 33438. [2020-12-23 03:44:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33438 states. [2020-12-23 03:44:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33438 states to 33438 states and 36792 transitions. [2020-12-23 03:44:04,446 INFO L78 Accepts]: Start accepts. Automaton has 33438 states and 36792 transitions. Word has length 448 [2020-12-23 03:44:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:44:04,446 INFO L481 AbstractCegarLoop]: Abstraction has 33438 states and 36792 transitions. [2020-12-23 03:44:04,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:44:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 33438 states and 36792 transitions. [2020-12-23 03:44:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2020-12-23 03:44:04,468 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:44:04,468 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 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] [2020-12-23 03:44:04,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 03:44:04,469 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:44:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:44:04,469 INFO L82 PathProgramCache]: Analyzing trace with hash 434381962, now seen corresponding path program 1 times [2020-12-23 03:44:04,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:44:04,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107765583] [2020-12-23 03:44:04,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:44:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-12-23 03:44:05,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107765583] [2020-12-23 03:44:05,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:44:05,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:44:05,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838330547] [2020-12-23 03:44:05,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:44:05,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:44:05,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:44:05,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:44:05,035 INFO L87 Difference]: Start difference. First operand 33438 states and 36792 transitions. Second operand 3 states. [2020-12-23 03:44:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:44:06,721 INFO L93 Difference]: Finished difference Result 69477 states and 76483 transitions. [2020-12-23 03:44:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:44:06,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 468 [2020-12-23 03:44:06,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:44:06,760 INFO L225 Difference]: With dead ends: 69477 [2020-12-23 03:44:06,761 INFO L226 Difference]: Without dead ends: 36225 [2020-12-23 03:44:06,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:44:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36225 states. [2020-12-23 03:44:07,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36225 to 35487. [2020-12-23 03:44:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35487 states. [2020-12-23 03:44:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35487 states to 35487 states and 38867 transitions. [2020-12-23 03:44:07,172 INFO L78 Accepts]: Start accepts. Automaton has 35487 states and 38867 transitions. Word has length 468 [2020-12-23 03:44:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:44:07,172 INFO L481 AbstractCegarLoop]: Abstraction has 35487 states and 38867 transitions. [2020-12-23 03:44:07,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:44:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 35487 states and 38867 transitions. [2020-12-23 03:44:07,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2020-12-23 03:44:07,191 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:44:07,191 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2020-12-23 03:44:07,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 03:44:07,192 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:44:07,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:44:07,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2056595, now seen corresponding path program 1 times [2020-12-23 03:44:07,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:44:07,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387848651] [2020-12-23 03:44:07,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:44:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 89 proven. 252 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-12-23 03:44:07,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387848651] [2020-12-23 03:44:07,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119044477] [2020-12-23 03:44:07,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:44:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:08,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 03:44:08,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:44:08,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 03:44:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 89 proven. 252 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-12-23 03:44:09,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 03:44:09,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2020-12-23 03:44:09,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711482285] [2020-12-23 03:44:09,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 03:44:09,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:44:09,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 03:44:09,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 03:44:09,077 INFO L87 Difference]: Start difference. First operand 35487 states and 38867 transitions. Second operand 7 states. [2020-12-23 03:44:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:44:13,464 INFO L93 Difference]: Finished difference Result 46555 states and 50891 transitions. [2020-12-23 03:44:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 03:44:13,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 468 [2020-12-23 03:44:13,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:44:13,505 INFO L225 Difference]: With dead ends: 46555 [2020-12-23 03:44:13,505 INFO L226 Difference]: Without dead ends: 46553 [2020-12-23 03:44:13,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 03:44:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46553 states. [2020-12-23 03:44:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46553 to 35487. [2020-12-23 03:44:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35487 states. [2020-12-23 03:44:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35487 states to 35487 states and 38867 transitions. [2020-12-23 03:44:13,961 INFO L78 Accepts]: Start accepts. Automaton has 35487 states and 38867 transitions. Word has length 468 [2020-12-23 03:44:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:44:13,962 INFO L481 AbstractCegarLoop]: Abstraction has 35487 states and 38867 transitions. [2020-12-23 03:44:13,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 03:44:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 35487 states and 38867 transitions. [2020-12-23 03:44:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2020-12-23 03:44:13,982 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:44:13,983 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:44:14,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:44:14,197 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:44:14,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:44:14,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1080254724, now seen corresponding path program 1 times [2020-12-23 03:44:14,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:44:14,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987513595] [2020-12-23 03:44:14,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:44:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2020-12-23 03:44:14,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987513595] [2020-12-23 03:44:14,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:44:14,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 03:44:14,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191415848] [2020-12-23 03:44:14,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:44:14,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:44:14,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:44:14,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:44:14,709 INFO L87 Difference]: Start difference. First operand 35487 states and 38867 transitions. Second operand 4 states. [2020-12-23 03:44:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:44:17,409 INFO L93 Difference]: Finished difference Result 71163 states and 77861 transitions. [2020-12-23 03:44:17,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:44:17,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 497 [2020-12-23 03:44:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:44:17,445 INFO L225 Difference]: With dead ends: 71163 [2020-12-23 03:44:17,446 INFO L226 Difference]: Without dead ends: 36783 [2020-12-23 03:44:17,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:44:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36783 states. [2020-12-23 03:44:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36783 to 27348. [2020-12-23 03:44:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2020-12-23 03:44:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 29790 transitions. [2020-12-23 03:44:17,762 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 29790 transitions. Word has length 497 [2020-12-23 03:44:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:44:17,762 INFO L481 AbstractCegarLoop]: Abstraction has 27348 states and 29790 transitions. [2020-12-23 03:44:17,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:44:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 29790 transitions. [2020-12-23 03:44:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2020-12-23 03:44:17,782 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:44:17,783 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 03:44:17,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 03:44:17,783 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:44:17,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:44:17,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2082130530, now seen corresponding path program 1 times [2020-12-23 03:44:17,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:44:17,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005707544] [2020-12-23 03:44:17,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:44:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 264 proven. 142 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2020-12-23 03:44:18,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005707544] [2020-12-23 03:44:18,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882779036] [2020-12-23 03:44:18,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:44:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:19,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 03:44:19,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:44:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 89 proven. 317 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2020-12-23 03:44:20,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 03:44:20,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2020-12-23 03:44:20,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331768583] [2020-12-23 03:44:20,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 03:44:20,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:44:20,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 03:44:20,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 03:44:20,184 INFO L87 Difference]: Start difference. First operand 27348 states and 29790 transitions. Second operand 8 states. [2020-12-23 03:44:24,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:44:24,091 INFO L93 Difference]: Finished difference Result 53930 states and 58782 transitions. [2020-12-23 03:44:24,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 03:44:24,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 521 [2020-12-23 03:44:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:44:24,121 INFO L225 Difference]: With dead ends: 53930 [2020-12-23 03:44:24,122 INFO L226 Difference]: Without dead ends: 26952 [2020-12-23 03:44:24,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-23 03:44:24,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26952 states. [2020-12-23 03:44:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26952 to 25286. [2020-12-23 03:44:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25286 states. [2020-12-23 03:44:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25286 states to 25286 states and 27544 transitions. [2020-12-23 03:44:24,545 INFO L78 Accepts]: Start accepts. Automaton has 25286 states and 27544 transitions. Word has length 521 [2020-12-23 03:44:24,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:44:24,546 INFO L481 AbstractCegarLoop]: Abstraction has 25286 states and 27544 transitions. [2020-12-23 03:44:24,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 03:44:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 25286 states and 27544 transitions. [2020-12-23 03:44:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2020-12-23 03:44:24,564 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:44:24,564 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:44:24,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:44:24,778 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:44:24,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:44:24,779 INFO L82 PathProgramCache]: Analyzing trace with hash -281523513, now seen corresponding path program 1 times [2020-12-23 03:44:24,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:44:24,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913040109] [2020-12-23 03:44:24,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:44:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-12-23 03:44:25,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913040109] [2020-12-23 03:44:25,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:44:25,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 03:44:25,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460382644] [2020-12-23 03:44:25,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 03:44:25,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:44:25,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 03:44:25,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 03:44:25,335 INFO L87 Difference]: Start difference. First operand 25286 states and 27544 transitions. Second operand 5 states. [2020-12-23 03:44:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:44:28,268 INFO L93 Difference]: Finished difference Result 36719 states and 39906 transitions. [2020-12-23 03:44:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 03:44:28,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 542 [2020-12-23 03:44:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:44:28,312 INFO L225 Difference]: With dead ends: 36719 [2020-12-23 03:44:28,312 INFO L226 Difference]: Without dead ends: 36717 [2020-12-23 03:44:28,322 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 03:44:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36717 states. [2020-12-23 03:44:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36717 to 29342. [2020-12-23 03:44:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29342 states. [2020-12-23 03:44:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29342 states to 29342 states and 31964 transitions. [2020-12-23 03:44:28,697 INFO L78 Accepts]: Start accepts. Automaton has 29342 states and 31964 transitions. Word has length 542 [2020-12-23 03:44:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:44:28,698 INFO L481 AbstractCegarLoop]: Abstraction has 29342 states and 31964 transitions. [2020-12-23 03:44:28,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 03:44:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 29342 states and 31964 transitions. [2020-12-23 03:44:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2020-12-23 03:44:28,721 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:44:28,721 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 03:44:28,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 03:44:28,722 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:44:28,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:44:28,722 INFO L82 PathProgramCache]: Analyzing trace with hash 586961002, now seen corresponding path program 1 times [2020-12-23 03:44:28,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:44:28,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712578072] [2020-12-23 03:44:28,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:44:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 30 proven. 396 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2020-12-23 03:44:29,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712578072] [2020-12-23 03:44:29,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79051451] [2020-12-23 03:44:29,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:44:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:29,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 03:44:29,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:44:30,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 03:44:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 30 proven. 396 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2020-12-23 03:44:30,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 03:44:30,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2020-12-23 03:44:30,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207321854] [2020-12-23 03:44:30,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 03:44:30,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:44:30,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 03:44:30,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 03:44:30,804 INFO L87 Difference]: Start difference. First operand 29342 states and 31964 transitions. Second operand 9 states. [2020-12-23 03:44:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:44:36,367 INFO L93 Difference]: Finished difference Result 78594 states and 85530 transitions. [2020-12-23 03:44:36,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 03:44:36,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 556 [2020-12-23 03:44:36,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:44:36,436 INFO L225 Difference]: With dead ends: 78594 [2020-12-23 03:44:36,436 INFO L226 Difference]: Without dead ends: 51466 [2020-12-23 03:44:36,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-23 03:44:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51466 states. [2020-12-23 03:44:37,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51466 to 47230. [2020-12-23 03:44:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47230 states. [2020-12-23 03:44:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47230 states to 47230 states and 51445 transitions. [2020-12-23 03:44:37,072 INFO L78 Accepts]: Start accepts. Automaton has 47230 states and 51445 transitions. Word has length 556 [2020-12-23 03:44:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:44:37,072 INFO L481 AbstractCegarLoop]: Abstraction has 47230 states and 51445 transitions. [2020-12-23 03:44:37,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 03:44:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 47230 states and 51445 transitions. [2020-12-23 03:44:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2020-12-23 03:44:37,092 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:44:37,092 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2020-12-23 03:44:37,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-12-23 03:44:37,308 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:44:37,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:44:37,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2126167551, now seen corresponding path program 1 times [2020-12-23 03:44:37,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:44:37,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953109913] [2020-12-23 03:44:37,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:44:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 558 proven. 54 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 03:44:38,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953109913] [2020-12-23 03:44:38,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859734633] [2020-12-23 03:44:38,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:44:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:38,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 03:44:38,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:44:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 612 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 03:44:39,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 03:44:39,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-12-23 03:44:39,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533590687] [2020-12-23 03:44:39,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:44:39,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:44:39,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:44:39,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 03:44:39,283 INFO L87 Difference]: Start difference. First operand 47230 states and 51445 transitions. Second operand 3 states. [2020-12-23 03:44:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:44:40,800 INFO L93 Difference]: Finished difference Result 96478 states and 105051 transitions. [2020-12-23 03:44:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:44:40,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 562 [2020-12-23 03:44:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:44:40,848 INFO L225 Difference]: With dead ends: 96478 [2020-12-23 03:44:40,848 INFO L226 Difference]: Without dead ends: 49434 [2020-12-23 03:44:40,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 03:44:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49434 states. [2020-12-23 03:44:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49434 to 47223. [2020-12-23 03:44:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47223 states. [2020-12-23 03:44:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47223 states to 47223 states and 51287 transitions. [2020-12-23 03:44:41,580 INFO L78 Accepts]: Start accepts. Automaton has 47223 states and 51287 transitions. Word has length 562 [2020-12-23 03:44:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:44:41,580 INFO L481 AbstractCegarLoop]: Abstraction has 47223 states and 51287 transitions. [2020-12-23 03:44:41,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:44:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 47223 states and 51287 transitions. [2020-12-23 03:44:41,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2020-12-23 03:44:41,617 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:44:41,618 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:44:41,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:44:41,832 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:44:41,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:44:41,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1931787159, now seen corresponding path program 1 times [2020-12-23 03:44:41,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:44:41,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781055825] [2020-12-23 03:44:41,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:44:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2020-12-23 03:44:42,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781055825] [2020-12-23 03:44:42,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:44:42,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:44:42,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384181078] [2020-12-23 03:44:42,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:44:42,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:44:42,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:44:42,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:44:42,458 INFO L87 Difference]: Start difference. First operand 47223 states and 51287 transitions. Second operand 4 states. [2020-12-23 03:44:45,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:44:45,028 INFO L93 Difference]: Finished difference Result 106787 states and 116167 transitions. [2020-12-23 03:44:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:44:45,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 577 [2020-12-23 03:44:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:44:45,091 INFO L225 Difference]: With dead ends: 106787 [2020-12-23 03:44:45,091 INFO L226 Difference]: Without dead ends: 59933 [2020-12-23 03:44:45,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:44:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59933 states. [2020-12-23 03:44:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59933 to 55871. [2020-12-23 03:44:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55871 states. [2020-12-23 03:44:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55871 states to 55871 states and 59932 transitions. [2020-12-23 03:44:46,138 INFO L78 Accepts]: Start accepts. Automaton has 55871 states and 59932 transitions. Word has length 577 [2020-12-23 03:44:46,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:44:46,138 INFO L481 AbstractCegarLoop]: Abstraction has 55871 states and 59932 transitions. [2020-12-23 03:44:46,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:44:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 55871 states and 59932 transitions. [2020-12-23 03:44:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2020-12-23 03:44:46,161 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:44:46,161 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:44:46,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 03:44:46,162 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:44:46,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:44:46,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1858983369, now seen corresponding path program 1 times [2020-12-23 03:44:46,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:44:46,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487754263] [2020-12-23 03:44:46,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:44:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2020-12-23 03:44:46,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487754263] [2020-12-23 03:44:46,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:44:46,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:44:46,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463021288] [2020-12-23 03:44:46,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:44:46,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:44:46,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:44:46,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:44:46,898 INFO L87 Difference]: Start difference. First operand 55871 states and 59932 transitions. Second operand 3 states. [2020-12-23 03:44:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:44:48,513 INFO L93 Difference]: Finished difference Result 109344 states and 117331 transitions. [2020-12-23 03:44:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:44:48,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 579 [2020-12-23 03:44:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:44:48,567 INFO L225 Difference]: With dead ends: 109344 [2020-12-23 03:44:48,568 INFO L226 Difference]: Without dead ends: 56239 [2020-12-23 03:44:48,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:44:48,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56239 states. [2020-12-23 03:44:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56239 to 55503. [2020-12-23 03:44:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55503 states. [2020-12-23 03:44:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55503 states to 55503 states and 59499 transitions. [2020-12-23 03:44:49,331 INFO L78 Accepts]: Start accepts. Automaton has 55503 states and 59499 transitions. Word has length 579 [2020-12-23 03:44:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:44:49,332 INFO L481 AbstractCegarLoop]: Abstraction has 55503 states and 59499 transitions. [2020-12-23 03:44:49,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:44:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 55503 states and 59499 transitions. [2020-12-23 03:44:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2020-12-23 03:44:49,587 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:44:49,588 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:44:49,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 03:44:49,588 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:44:49,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:44:49,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1361898892, now seen corresponding path program 1 times [2020-12-23 03:44:49,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:44:49,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840558240] [2020-12-23 03:44:49,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:44:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 844 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-12-23 03:44:50,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840558240] [2020-12-23 03:44:50,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:44:50,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:44:50,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958982349] [2020-12-23 03:44:50,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:44:50,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:44:50,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:44:50,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:44:50,255 INFO L87 Difference]: Start difference. First operand 55503 states and 59499 transitions. Second operand 3 states. [2020-12-23 03:44:51,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:44:51,843 INFO L93 Difference]: Finished difference Result 112658 states and 120782 transitions. [2020-12-23 03:44:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:44:51,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 654 [2020-12-23 03:44:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:44:51,909 INFO L225 Difference]: With dead ends: 112658 [2020-12-23 03:44:51,910 INFO L226 Difference]: Without dead ends: 57525 [2020-12-23 03:44:51,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:44:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57525 states. [2020-12-23 03:44:52,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57525 to 38187. [2020-12-23 03:44:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38187 states. [2020-12-23 03:44:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38187 states to 38187 states and 40636 transitions. [2020-12-23 03:44:52,748 INFO L78 Accepts]: Start accepts. Automaton has 38187 states and 40636 transitions. Word has length 654 [2020-12-23 03:44:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:44:52,748 INFO L481 AbstractCegarLoop]: Abstraction has 38187 states and 40636 transitions. [2020-12-23 03:44:52,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:44:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 38187 states and 40636 transitions. [2020-12-23 03:44:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2020-12-23 03:44:52,772 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:44:52,772 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:44:52,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 03:44:52,772 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:44:52,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:44:52,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1010370606, now seen corresponding path program 1 times [2020-12-23 03:44:52,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:44:52,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777671371] [2020-12-23 03:44:52,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:44:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 154 proven. 846 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:44:54,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777671371] [2020-12-23 03:44:54,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732827011] [2020-12-23 03:44:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:44:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:44:54,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 03:44:54,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:44:55,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 03:44:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 30 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:44:55,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 03:44:55,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-12-23 03:44:55,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643461906] [2020-12-23 03:44:55,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 03:44:55,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:44:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 03:44:55,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-12-23 03:44:55,708 INFO L87 Difference]: Start difference. First operand 38187 states and 40636 transitions. Second operand 13 states. [2020-12-23 03:45:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:45:05,731 INFO L93 Difference]: Finished difference Result 104401 states and 110969 transitions. [2020-12-23 03:45:05,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 03:45:05,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 673 [2020-12-23 03:45:05,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:45:05,794 INFO L225 Difference]: With dead ends: 104401 [2020-12-23 03:45:05,794 INFO L226 Difference]: Without dead ends: 67322 [2020-12-23 03:45:05,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 667 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-12-23 03:45:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67322 states. [2020-12-23 03:45:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67322 to 43173. [2020-12-23 03:45:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43173 states. [2020-12-23 03:45:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43173 states to 43173 states and 45916 transitions. [2020-12-23 03:45:06,605 INFO L78 Accepts]: Start accepts. Automaton has 43173 states and 45916 transitions. Word has length 673 [2020-12-23 03:45:06,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:45:06,606 INFO L481 AbstractCegarLoop]: Abstraction has 43173 states and 45916 transitions. [2020-12-23 03:45:06,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 03:45:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 43173 states and 45916 transitions. [2020-12-23 03:45:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2020-12-23 03:45:06,626 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:45:06,626 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:45:06,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-12-23 03:45:06,828 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:45:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:45:06,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1017261904, now seen corresponding path program 1 times [2020-12-23 03:45:06,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:45:06,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031187582] [2020-12-23 03:45:06,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:45:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:45:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 676 proven. 199 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2020-12-23 03:45:07,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031187582] [2020-12-23 03:45:07,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861445146] [2020-12-23 03:45:07,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 03:45:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:45:08,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 03:45:08,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:45:08,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 03:45:08,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 03:45:08,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 03:45:08,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 03:45:08,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 03:45:08,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 03:45:08,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 03:45:08,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 03:45:08,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 03:45:08,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 03:45:08,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 03:45:08,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 03:45:08,869 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:09,169 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:09,469 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:09,731 INFO L757 QuantifierPusher]: Run 40 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:09,935 INFO L757 QuantifierPusher]: Run 50 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:10,149 INFO L757 QuantifierPusher]: Run 60 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:10,577 INFO L757 QuantifierPusher]: Run 70 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:11,383 INFO L757 QuantifierPusher]: Run 80 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:12,587 INFO L757 QuantifierPusher]: Run 90 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:13,986 INFO L757 QuantifierPusher]: Run 100 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:15,897 INFO L757 QuantifierPusher]: Run 110 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:18,306 INFO L757 QuantifierPusher]: Run 120 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:20,994 INFO L757 QuantifierPusher]: Run 130 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:24,088 INFO L757 QuantifierPusher]: Run 140 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:27,880 INFO L757 QuantifierPusher]: Run 150 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:45:31,937 INFO L757 QuantifierPusher]: Run 160 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug.