java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4cf2d92 [2018-03-28 12:53:20,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-28 12:53:20,246 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-28 12:53:20,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-28 12:53:20,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-28 12:53:20,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-28 12:53:20,261 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-28 12:53:20,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-28 12:53:20,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-28 12:53:20,266 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-28 12:53:20,267 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-28 12:53:20,267 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-28 12:53:20,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-28 12:53:20,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-28 12:53:20,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-28 12:53:20,272 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-28 12:53:20,274 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-28 12:53:20,276 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-28 12:53:20,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-28 12:53:20,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-28 12:53:20,281 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-28 12:53:20,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-28 12:53:20,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-28 12:53:20,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-28 12:53:20,283 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-28 12:53:20,284 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-28 12:53:20,285 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-28 12:53:20,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-28 12:53:20,286 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-28 12:53:20,286 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-28 12:53:20,287 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-28 12:53:20,287 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-03-28 12:53:20,311 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-28 12:53:20,311 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-28 12:53:20,312 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-28 12:53:20,312 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-28 12:53:20,312 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-28 12:53:20,312 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-28 12:53:20,313 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-28 12:53:20,313 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-28 12:53:20,313 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-28 12:53:20,313 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-28 12:53:20,313 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-28 12:53:20,313 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-28 12:53:20,313 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-28 12:53:20,314 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-28 12:53:20,314 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-28 12:53:20,314 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-28 12:53:20,314 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-28 12:53:20,314 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-28 12:53:20,314 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-28 12:53:20,315 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-28 12:53:20,315 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-28 12:53:20,315 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-28 12:53:20,315 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-28 12:53:20,315 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-28 12:53:20,315 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-28 12:53:20,316 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-28 12:53:20,316 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-28 12:53:20,316 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-28 12:53:20,316 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-28 12:53:20,316 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-28 12:53:20,316 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-28 12:53:20,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:20,317 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-28 12:53:20,317 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-28 12:53:20,318 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-28 12:53:20,318 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-28 12:53:20,318 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-28 12:53:20,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-28 12:53:20,360 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-28 12:53:20,363 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-28 12:53:20,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-28 12:53:20,365 INFO L276 PluginConnector]: CDTParser initialized [2018-03-28 12:53:20,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,658 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc9740999a [2018-03-28 12:53:20,856 INFO L291 CDTParser]: IsIndexed: true [2018-03-28 12:53:20,856 INFO L292 CDTParser]: Found 1 translation units. [2018-03-28 12:53:20,857 INFO L171 CDTParser]: Scanning tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,867 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-28 12:53:20,868 INFO L215 ultiparseSymbolTable]: [2018-03-28 12:53:20,868 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-28 12:53:20,868 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,868 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-28 12:53:20,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsfilcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ino_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int32_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pid_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int64_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__TreeNode in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__gid_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__off_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsfilcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blkcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ldiv_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int8_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ssize_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__timer_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____socklen_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__register_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____nlink_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_mutex_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__key_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____rlim_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsblkcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____swblk_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int32_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,871 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____time_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int8_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____suseconds_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsblkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____timer_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____rlim64_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsfilcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_mutexattr_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint32_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,872 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__wchar_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_condattr_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fd_set in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____clockid_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_attr_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____caddr_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__quad_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____dev_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,873 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__mode_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__lldiv_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__uid_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int16_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__suseconds_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____sigset_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_short in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__size_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,874 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int16_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ulong in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_cond_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_once_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____intptr_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__div_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_long in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__blksize_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_spinlock_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_short in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__caddr_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____mode_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ino_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__clock_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__daddr_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsid_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int16_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_rwlockattr_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_long in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_char in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_barrier_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____off_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__blkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ListNode in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____pthread_list_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_barrierattr_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____loff_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int64_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____WAIT_STATUS in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int32_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsid_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ushort in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_quad_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_quad_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____clock_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_char in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint8_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blksize_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____gid_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____off64_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____quad_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,878 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____pid_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint16_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____qaddr_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____daddr_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__loff_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__id_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__uint in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int8_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_rwlock_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_int in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____useconds_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__dev_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__nlink_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fd_mask in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____id_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____key_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int64_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__time_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__clockid_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_key_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsblkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____sig_atomic_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fd_mask in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint64_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uid_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ssize_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ino64_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__sigset_t in tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:20,913 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc9740999a [2018-03-28 12:53:20,918 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-28 12:53:20,922 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-28 12:53:20,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-28 12:53:20,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-28 12:53:20,929 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-28 12:53:20,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:53:20" (1/1) ... [2018-03-28 12:53:20,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1f3aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:53:20, skipping insertion in model container [2018-03-28 12:53:20,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:53:20" (1/1) ... [2018-03-28 12:53:20,945 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-28 12:53:20,978 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-28 12:53:21,155 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-28 12:53:21,210 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-28 12:53:21,216 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-03-28 12:53:21,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:53:21 WrapperNode [2018-03-28 12:53:21,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-28 12:53:21,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-28 12:53:21,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-28 12:53:21,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-28 12:53:21,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:53:21" (1/1) ... [2018-03-28 12:53:21,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:53:21" (1/1) ... [2018-03-28 12:53:21,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:53:21" (1/1) ... [2018-03-28 12:53:21,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:53:21" (1/1) ... [2018-03-28 12:53:21,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:53:21" (1/1) ... [2018-03-28 12:53:21,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:53:21" (1/1) ... [2018-03-28 12:53:21,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:53:21" (1/1) ... [2018-03-28 12:53:21,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-28 12:53:21,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-28 12:53:21,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-28 12:53:21,331 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-28 12:53:21,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:53:21" (1/1) ... No working directory specified, using /storage/ultimate/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 [2018-03-28 12:53:21,446 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-28 12:53:21,447 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-28 12:53:21,447 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-28 12:53:21,447 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-03-28 12:53:21,447 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-03-28 12:53:21,447 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-03-28 12:53:21,447 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-03-28 12:53:21,447 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-03-28 12:53:21,447 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-03-28 12:53:21,447 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-03-28 12:53:21,447 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-03-28 12:53:21,448 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-03-28 12:53:21,448 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-03-28 12:53:21,448 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-03-28 12:53:21,448 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-03-28 12:53:21,448 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-03-28 12:53:21,448 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-03-28 12:53:21,448 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-03-28 12:53:21,448 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-03-28 12:53:21,448 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-03-28 12:53:21,448 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-03-28 12:53:21,448 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-03-28 12:53:21,449 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-03-28 12:53:21,449 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-03-28 12:53:21,449 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-03-28 12:53:21,449 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-03-28 12:53:21,449 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-03-28 12:53:21,449 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-03-28 12:53:21,449 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-03-28 12:53:21,449 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-03-28 12:53:21,449 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-03-28 12:53:21,449 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-03-28 12:53:21,449 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-03-28 12:53:21,449 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-03-28 12:53:21,450 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-03-28 12:53:21,450 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-03-28 12:53:21,450 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-03-28 12:53:21,450 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-03-28 12:53:21,450 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-03-28 12:53:21,450 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-03-28 12:53:21,450 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-03-28 12:53:21,450 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-03-28 12:53:21,450 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-03-28 12:53:21,450 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-03-28 12:53:21,450 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-03-28 12:53:21,450 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-03-28 12:53:21,451 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-03-28 12:53:21,451 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-03-28 12:53:21,451 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-03-28 12:53:21,451 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-03-28 12:53:21,451 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-03-28 12:53:21,451 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-03-28 12:53:21,451 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-03-28 12:53:21,451 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-03-28 12:53:21,452 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-03-28 12:53:21,452 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-28 12:53:21,452 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-03-28 12:53:21,452 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-03-28 12:53:21,452 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-28 12:53:21,452 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-03-28 12:53:21,452 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-03-28 12:53:21,452 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-03-28 12:53:21,452 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-03-28 12:53:21,452 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-03-28 12:53:21,452 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-03-28 12:53:21,452 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-03-28 12:53:21,452 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-03-28 12:53:21,453 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-03-28 12:53:21,453 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-03-28 12:53:21,453 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-03-28 12:53:21,453 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-03-28 12:53:21,453 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-03-28 12:53:21,453 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-03-28 12:53:21,453 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-03-28 12:53:21,453 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-03-28 12:53:21,453 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-03-28 12:53:21,453 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-03-28 12:53:21,453 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-03-28 12:53:21,453 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-03-28 12:53:21,453 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-03-28 12:53:21,454 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-03-28 12:53:21,454 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-03-28 12:53:21,454 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-03-28 12:53:21,454 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-03-28 12:53:21,454 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-03-28 12:53:21,454 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-03-28 12:53:21,454 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-03-28 12:53:21,454 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-03-28 12:53:21,454 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-03-28 12:53:21,454 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-03-28 12:53:21,454 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-03-28 12:53:21,455 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-03-28 12:53:21,455 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-03-28 12:53:21,455 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-03-28 12:53:21,455 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-03-28 12:53:21,455 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-03-28 12:53:21,455 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-03-28 12:53:21,455 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-03-28 12:53:21,455 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-03-28 12:53:21,456 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-03-28 12:53:21,456 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-03-28 12:53:21,456 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-03-28 12:53:21,456 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-03-28 12:53:21,456 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-03-28 12:53:21,456 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-03-28 12:53:21,456 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-03-28 12:53:21,456 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-28 12:53:21,457 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-28 12:53:21,457 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-03-28 12:53:21,457 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-03-28 12:53:21,457 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-28 12:53:21,457 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-28 12:53:21,457 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-28 12:53:22,210 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-28 12:53:22,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:53:22 BoogieIcfgContainer [2018-03-28 12:53:22,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-28 12:53:22,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-28 12:53:22,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-28 12:53:22,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-28 12:53:22,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:53:20" (1/3) ... [2018-03-28 12:53:22,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256d6c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:53:22, skipping insertion in model container [2018-03-28 12:53:22,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:53:21" (2/3) ... [2018-03-28 12:53:22,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256d6c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:53:22, skipping insertion in model container [2018-03-28 12:53:22,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:53:22" (3/3) ... [2018-03-28 12:53:22,219 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_of_cslls_true-valid-memsafety.i [2018-03-28 12:53:22,229 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-28 12:53:22,236 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-03-28 12:53:22,284 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-28 12:53:22,285 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-28 12:53:22,285 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-28 12:53:22,285 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-28 12:53:22,285 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-28 12:53:22,285 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-28 12:53:22,285 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-28 12:53:22,285 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-28 12:53:22,285 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-28 12:53:22,286 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-28 12:53:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2018-03-28 12:53:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-03-28 12:53:22,313 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:22,314 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:53:22,315 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:22,319 INFO L82 PathProgramCache]: Analyzing trace with hash 634925375, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:22,334 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:22,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:22,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:53:22,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:22,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:22,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 12:53:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:22,435 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:22,475 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:22,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:53:22,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-28 12:53:22,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-28 12:53:22,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-28 12:53:22,489 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2018-03-28 12:53:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:23,007 INFO L93 Difference]: Finished difference Result 682 states and 740 transitions. [2018-03-28 12:53:23,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-28 12:53:23,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-03-28 12:53:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:23,024 INFO L225 Difference]: With dead ends: 682 [2018-03-28 12:53:23,024 INFO L226 Difference]: Without dead ends: 435 [2018-03-28 12:53:23,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-28 12:53:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-03-28 12:53:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 280. [2018-03-28 12:53:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-03-28 12:53:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 296 transitions. [2018-03-28 12:53:23,079 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 296 transitions. Word has length 11 [2018-03-28 12:53:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:23,079 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 296 transitions. [2018-03-28 12:53:23,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-28 12:53:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 296 transitions. [2018-03-28 12:53:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-03-28 12:53:23,080 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:23,080 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:53:23,080 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash 634925376, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:23,086 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:23,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:23,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:53:23,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:23,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:23,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:53:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:23,118 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:23,159 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:23,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-28 12:53:23,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 12:53:23,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 12:53:23,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-28 12:53:23,162 INFO L87 Difference]: Start difference. First operand 280 states and 296 transitions. Second operand 6 states. [2018-03-28 12:53:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:23,626 INFO L93 Difference]: Finished difference Result 576 states and 613 transitions. [2018-03-28 12:53:23,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 12:53:23,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-03-28 12:53:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:23,630 INFO L225 Difference]: With dead ends: 576 [2018-03-28 12:53:23,630 INFO L226 Difference]: Without dead ends: 574 [2018-03-28 12:53:23,632 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-03-28 12:53:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-03-28 12:53:23,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 278. [2018-03-28 12:53:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-03-28 12:53:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 294 transitions. [2018-03-28 12:53:23,653 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 294 transitions. Word has length 11 [2018-03-28 12:53:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:23,653 INFO L459 AbstractCegarLoop]: Abstraction has 278 states and 294 transitions. [2018-03-28 12:53:23,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 12:53:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 294 transitions. [2018-03-28 12:53:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-03-28 12:53:23,654 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:23,654 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:53:23,654 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:23,654 INFO L82 PathProgramCache]: Analyzing trace with hash 25855279, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:23,661 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:23,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:23,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:53:23,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:23,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:23,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:53:23,719 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:23,720 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:23,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-03-28 12:53:23,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:23,732 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:23,733 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:23,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:53:23,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:23,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:53:23,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-03-28 12:53:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:23,757 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:23,896 WARN L148 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 27 [2018-03-28 12:53:23,932 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:23,932 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:23,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-03-28 12:53:23,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:23,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:53:23,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2018-03-28 12:53:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:24,002 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:24,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2018-03-28 12:53:24,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-28 12:53:24,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-28 12:53:24,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-03-28 12:53:24,003 INFO L87 Difference]: Start difference. First operand 278 states and 294 transitions. Second operand 12 states. [2018-03-28 12:53:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:24,754 INFO L93 Difference]: Finished difference Result 494 states and 522 transitions. [2018-03-28 12:53:24,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-28 12:53:24,754 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-03-28 12:53:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:24,757 INFO L225 Difference]: With dead ends: 494 [2018-03-28 12:53:24,757 INFO L226 Difference]: Without dead ends: 487 [2018-03-28 12:53:24,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-03-28 12:53:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-03-28 12:53:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 271. [2018-03-28 12:53:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-03-28 12:53:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 287 transitions. [2018-03-28 12:53:24,771 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 287 transitions. Word has length 14 [2018-03-28 12:53:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:24,771 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 287 transitions. [2018-03-28 12:53:24,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-28 12:53:24,772 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 287 transitions. [2018-03-28 12:53:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-03-28 12:53:24,772 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:24,772 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:53:24,772 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:24,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1455428104, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:24,778 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:24,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:24,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:53:24,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:24,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:24,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 12:53:24,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:53:24,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:53:24,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:24,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:24,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:24,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-03-28 12:53:24,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-03-28 12:53:24,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-03-28 12:53:24,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:24,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:24,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:24,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-03-28 12:53:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:24,916 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:24,951 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:24,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-03-28 12:53:24,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-28 12:53:24,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-28 12:53:24,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-28 12:53:24,951 INFO L87 Difference]: Start difference. First operand 271 states and 287 transitions. Second operand 5 states. [2018-03-28 12:53:25,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:25,179 INFO L93 Difference]: Finished difference Result 376 states and 398 transitions. [2018-03-28 12:53:25,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 12:53:25,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-03-28 12:53:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:25,181 INFO L225 Difference]: With dead ends: 376 [2018-03-28 12:53:25,181 INFO L226 Difference]: Without dead ends: 375 [2018-03-28 12:53:25,181 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-03-28 12:53:25,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-03-28 12:53:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 270. [2018-03-28 12:53:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-03-28 12:53:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 286 transitions. [2018-03-28 12:53:25,190 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 286 transitions. Word has length 17 [2018-03-28 12:53:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:25,190 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 286 transitions. [2018-03-28 12:53:25,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-28 12:53:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 286 transitions. [2018-03-28 12:53:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-03-28 12:53:25,191 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:25,191 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:53:25,191 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:25,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1455428105, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:25,197 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:25,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:25,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:53:25,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:53:25,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:53:25,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:53:25,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:53:25,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:53:25,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-03-28 12:53:25,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-03-28 12:53:25,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-03-28 12:53:25,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-28 12:53:25,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-03-28 12:53:25,303 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,307 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-03-28 12:53:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:25,313 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:25,361 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:25,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-03-28 12:53:25,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-28 12:53:25,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-28 12:53:25,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-03-28 12:53:25,362 INFO L87 Difference]: Start difference. First operand 270 states and 286 transitions. Second operand 8 states. [2018-03-28 12:53:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:25,783 INFO L93 Difference]: Finished difference Result 464 states and 494 transitions. [2018-03-28 12:53:25,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-28 12:53:25,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-03-28 12:53:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:25,785 INFO L225 Difference]: With dead ends: 464 [2018-03-28 12:53:25,785 INFO L226 Difference]: Without dead ends: 463 [2018-03-28 12:53:25,786 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-03-28 12:53:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-03-28 12:53:25,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 269. [2018-03-28 12:53:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-03-28 12:53:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 285 transitions. [2018-03-28 12:53:25,796 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 285 transitions. Word has length 17 [2018-03-28 12:53:25,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:25,797 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 285 transitions. [2018-03-28 12:53:25,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-28 12:53:25,797 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 285 transitions. [2018-03-28 12:53:25,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-03-28 12:53:25,798 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:25,798 INFO L355 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] [2018-03-28 12:53:25,798 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:25,798 INFO L82 PathProgramCache]: Analyzing trace with hash 721792145, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:25,806 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:25,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:25,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:53:25,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,838 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:25,838 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:25,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-03-28 12:53:25,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-03-28 12:53:25,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:53:25,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:53:25,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:53:25,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:53:25,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,888 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:47 [2018-03-28 12:53:25,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-03-28 12:53:25,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:53:25,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-03-28 12:53:25,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:53:25,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:25,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:47 [2018-03-28 12:53:25,989 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:25,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-03-28 12:53:25,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,015 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:26,017 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:26,018 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:26,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-03-28 12:53:26,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:53:26,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:50 [2018-03-28 12:53:26,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-03-28 12:53:26,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-03-28 12:53:26,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-28 12:53:26,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-03-28 12:53:26,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:53:26,117 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:18 [2018-03-28 12:53:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:26,132 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:26,440 WARN L148 SmtUtils]: Spent 181ms on a formula simplification that was a NOOP. DAG size: 49 [2018-03-28 12:53:26,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 76 [2018-03-28 12:53:26,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:53:26,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-03-28 12:53:26,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-03-28 12:53:26,552 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-03-28 12:53:26,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:53:26,558 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,571 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:53:26,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-03-28 12:53:26,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:53:26,670 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-03-28 12:53:26,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-03-28 12:53:26,695 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,699 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-03-28 12:53:26,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:53:26,707 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,712 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,725 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:53:26,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-03-28 12:53:26,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:53:26,789 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-03-28 12:53:26,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2018-03-28 12:53:26,798 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,799 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,803 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2018-03-28 12:53:26,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:53:26,828 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-03-28 12:53:26,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:53:26,838 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,839 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,845 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-03-28 12:53:26,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:53:26,864 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-03-28 12:53:26,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2018-03-28 12:53:26,874 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,875 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,879 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-03-28 12:53:26,912 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 12 variables, input treesize:130, output treesize:83 [2018-03-28 12:53:26,959 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-28 12:53:26,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:26,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:53:26,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:16 [2018-03-28 12:53:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:27,030 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:27,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2018-03-28 12:53:27,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-03-28 12:53:27,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-03-28 12:53:27,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-03-28 12:53:27,031 INFO L87 Difference]: Start difference. First operand 269 states and 285 transitions. Second operand 15 states. [2018-03-28 12:53:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:28,507 INFO L93 Difference]: Finished difference Result 576 states and 613 transitions. [2018-03-28 12:53:28,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-28 12:53:28,548 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-03-28 12:53:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:28,551 INFO L225 Difference]: With dead ends: 576 [2018-03-28 12:53:28,551 INFO L226 Difference]: Without dead ends: 575 [2018-03-28 12:53:28,551 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2018-03-28 12:53:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-03-28 12:53:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 277. [2018-03-28 12:53:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-03-28 12:53:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 295 transitions. [2018-03-28 12:53:28,565 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 295 transitions. Word has length 27 [2018-03-28 12:53:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:28,565 INFO L459 AbstractCegarLoop]: Abstraction has 277 states and 295 transitions. [2018-03-28 12:53:28,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-03-28 12:53:28,565 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 295 transitions. [2018-03-28 12:53:28,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-03-28 12:53:28,566 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:28,566 INFO L355 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] [2018-03-28 12:53:28,566 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:28,567 INFO L82 PathProgramCache]: Analyzing trace with hash 721792144, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:28,577 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:28,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:28,614 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,615 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:28,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-03-28 12:53:28,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-03-28 12:53:28,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:53:28,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:53:28,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-03-28 12:53:28,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-03-28 12:53:28,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:53:28,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:27 [2018-03-28 12:53:28,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-03-28 12:53:28,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:53:28,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2018-03-28 12:53:28,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:53:28,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-03-28 12:53:28,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:28,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:53:28,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15 [2018-03-28 12:53:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:28,732 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:29,543 WARN L148 SmtUtils]: Spent 755ms on a formula simplification that was a NOOP. DAG size: 19 [2018-03-28 12:53:29,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-03-28 12:53:29,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:53:29,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-03-28 12:53:29,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2018-03-28 12:53:29,578 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-03-28 12:53:29,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:53:29,582 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,586 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:29,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:53:29,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-03-28 12:53:29,610 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2018-03-28 12:53:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:29,674 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:29,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 12 [2018-03-28 12:53:29,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-28 12:53:29,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-28 12:53:29,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-03-28 12:53:29,675 INFO L87 Difference]: Start difference. First operand 277 states and 295 transitions. Second operand 13 states. [2018-03-28 12:53:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:30,319 INFO L93 Difference]: Finished difference Result 518 states and 554 transitions. [2018-03-28 12:53:30,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-28 12:53:30,319 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-03-28 12:53:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:30,321 INFO L225 Difference]: With dead ends: 518 [2018-03-28 12:53:30,321 INFO L226 Difference]: Without dead ends: 517 [2018-03-28 12:53:30,321 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-03-28 12:53:30,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-03-28 12:53:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 277. [2018-03-28 12:53:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-03-28 12:53:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 294 transitions. [2018-03-28 12:53:30,332 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 294 transitions. Word has length 27 [2018-03-28 12:53:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:30,332 INFO L459 AbstractCegarLoop]: Abstraction has 277 states and 294 transitions. [2018-03-28 12:53:30,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-28 12:53:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 294 transitions. [2018-03-28 12:53:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-03-28 12:53:30,333 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:30,334 INFO L355 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] [2018-03-28 12:53:30,334 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:30,334 INFO L82 PathProgramCache]: Analyzing trace with hash 900720003, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:30,343 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:30,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:30,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:53:30,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:30,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:30,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 12:53:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:30,387 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:30,427 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:30,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:53:30,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-28 12:53:30,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-28 12:53:30,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-28 12:53:30,428 INFO L87 Difference]: Start difference. First operand 277 states and 294 transitions. Second operand 4 states. [2018-03-28 12:53:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:30,738 INFO L93 Difference]: Finished difference Result 691 states and 739 transitions. [2018-03-28 12:53:30,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-28 12:53:30,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-03-28 12:53:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:30,742 INFO L225 Difference]: With dead ends: 691 [2018-03-28 12:53:30,742 INFO L226 Difference]: Without dead ends: 689 [2018-03-28 12:53:30,745 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-28 12:53:30,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-03-28 12:53:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 275. [2018-03-28 12:53:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-03-28 12:53:30,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 292 transitions. [2018-03-28 12:53:30,760 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 292 transitions. Word has length 28 [2018-03-28 12:53:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:30,760 INFO L459 AbstractCegarLoop]: Abstraction has 275 states and 292 transitions. [2018-03-28 12:53:30,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-28 12:53:30,761 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 292 transitions. [2018-03-28 12:53:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-03-28 12:53:30,761 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:30,762 INFO L355 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] [2018-03-28 12:53:30,762 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash 900720004, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:30,772 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:30,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:30,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:53:30,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:30,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:30,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:53:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:30,808 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:30,852 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:30,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-28 12:53:30,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 12:53:30,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 12:53:30,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-28 12:53:30,853 INFO L87 Difference]: Start difference. First operand 275 states and 292 transitions. Second operand 6 states. [2018-03-28 12:53:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:31,258 INFO L93 Difference]: Finished difference Result 729 states and 781 transitions. [2018-03-28 12:53:31,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-28 12:53:31,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-03-28 12:53:31,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:31,261 INFO L225 Difference]: With dead ends: 729 [2018-03-28 12:53:31,261 INFO L226 Difference]: Without dead ends: 728 [2018-03-28 12:53:31,261 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-03-28 12:53:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-03-28 12:53:31,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 274. [2018-03-28 12:53:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-03-28 12:53:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 291 transitions. [2018-03-28 12:53:31,269 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 291 transitions. Word has length 28 [2018-03-28 12:53:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:31,270 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 291 transitions. [2018-03-28 12:53:31,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 12:53:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 291 transitions. [2018-03-28 12:53:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-03-28 12:53:31,271 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:31,271 INFO L355 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] [2018-03-28 12:53:31,271 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash -310904415, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:31,278 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:31,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:31,330 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:31,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:31,355 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:31,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:53:31,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-28 12:53:31,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-28 12:53:31,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-28 12:53:31,356 INFO L87 Difference]: Start difference. First operand 274 states and 291 transitions. Second operand 4 states. [2018-03-28 12:53:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:31,935 INFO L93 Difference]: Finished difference Result 393 states and 426 transitions. [2018-03-28 12:53:31,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-28 12:53:31,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-03-28 12:53:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:31,937 INFO L225 Difference]: With dead ends: 393 [2018-03-28 12:53:31,937 INFO L226 Difference]: Without dead ends: 375 [2018-03-28 12:53:31,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-28 12:53:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-03-28 12:53:31,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 269. [2018-03-28 12:53:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-03-28 12:53:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 290 transitions. [2018-03-28 12:53:31,945 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 290 transitions. Word has length 30 [2018-03-28 12:53:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:31,946 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 290 transitions. [2018-03-28 12:53:31,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-28 12:53:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 290 transitions. [2018-03-28 12:53:31,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-03-28 12:53:31,947 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:31,947 INFO L355 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] [2018-03-28 12:53:31,947 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:31,947 INFO L82 PathProgramCache]: Analyzing trace with hash -310904414, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:31,961 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:31,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:32,132 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:32,214 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-28 12:53:32,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:32,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-03-28 12:53:32,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:32,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:32,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2018-03-28 12:53:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:32,268 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:32,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-03-28 12:53:32,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-28 12:53:32,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-28 12:53:32,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-03-28 12:53:32,269 INFO L87 Difference]: Start difference. First operand 269 states and 290 transitions. Second operand 7 states. [2018-03-28 12:53:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:32,691 INFO L93 Difference]: Finished difference Result 580 states and 646 transitions. [2018-03-28 12:53:32,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-28 12:53:32,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-03-28 12:53:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:32,695 INFO L225 Difference]: With dead ends: 580 [2018-03-28 12:53:32,695 INFO L226 Difference]: Without dead ends: 564 [2018-03-28 12:53:32,695 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-03-28 12:53:32,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-03-28 12:53:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 446. [2018-03-28 12:53:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-03-28 12:53:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 530 transitions. [2018-03-28 12:53:32,716 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 530 transitions. Word has length 30 [2018-03-28 12:53:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:32,717 INFO L459 AbstractCegarLoop]: Abstraction has 446 states and 530 transitions. [2018-03-28 12:53:32,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-28 12:53:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 530 transitions. [2018-03-28 12:53:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-03-28 12:53:32,718 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:32,718 INFO L355 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] [2018-03-28 12:53:32,718 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:32,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1131429772, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:32,729 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:32,749 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:32,766 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:32,816 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:32,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-03-28 12:53:32,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-28 12:53:32,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-28 12:53:32,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-28 12:53:32,817 INFO L87 Difference]: Start difference. First operand 446 states and 530 transitions. Second operand 4 states. [2018-03-28 12:53:32,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:32,875 INFO L93 Difference]: Finished difference Result 544 states and 634 transitions. [2018-03-28 12:53:32,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-28 12:53:32,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-03-28 12:53:32,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:32,878 INFO L225 Difference]: With dead ends: 544 [2018-03-28 12:53:32,879 INFO L226 Difference]: Without dead ends: 541 [2018-03-28 12:53:32,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-28 12:53:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-03-28 12:53:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 515. [2018-03-28 12:53:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-03-28 12:53:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 627 transitions. [2018-03-28 12:53:32,900 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 627 transitions. Word has length 31 [2018-03-28 12:53:32,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:32,900 INFO L459 AbstractCegarLoop]: Abstraction has 515 states and 627 transitions. [2018-03-28 12:53:32,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-28 12:53:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 627 transitions. [2018-03-28 12:53:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-03-28 12:53:32,901 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:32,901 INFO L355 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] [2018-03-28 12:53:32,902 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:32,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1752548743, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:32,926 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:32,953 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:32,992 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:32,993 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:32,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:53:32,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:32,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:32,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-03-28 12:53:33,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-03-28 12:53:33,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:53:33,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:33,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:33,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:33,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-03-28 12:53:33,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-03-28 12:53:33,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-03-28 12:53:33,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:33,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:33,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:33,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-03-28 12:53:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:33,059 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:33,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-03-28 12:53:33,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:33,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:53:33,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:17 [2018-03-28 12:53:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:33,200 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:33,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2018-03-28 12:53:33,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-28 12:53:33,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-28 12:53:33,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-03-28 12:53:33,201 INFO L87 Difference]: Start difference. First operand 515 states and 627 transitions. Second operand 11 states. [2018-03-28 12:53:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:33,946 INFO L93 Difference]: Finished difference Result 1734 states and 2127 transitions. [2018-03-28 12:53:33,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-03-28 12:53:33,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-03-28 12:53:33,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:33,987 INFO L225 Difference]: With dead ends: 1734 [2018-03-28 12:53:33,987 INFO L226 Difference]: Without dead ends: 1733 [2018-03-28 12:53:33,988 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2018-03-28 12:53:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2018-03-28 12:53:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 514. [2018-03-28 12:53:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-03-28 12:53:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 626 transitions. [2018-03-28 12:53:34,007 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 626 transitions. Word has length 32 [2018-03-28 12:53:34,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:34,008 INFO L459 AbstractCegarLoop]: Abstraction has 514 states and 626 transitions. [2018-03-28 12:53:34,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-28 12:53:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 626 transitions. [2018-03-28 12:53:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-03-28 12:53:34,009 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:34,009 INFO L355 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] [2018-03-28 12:53:34,009 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:34,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1752548744, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:34,015 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:34,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:34,064 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:34,072 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:34,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:53:34,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-03-28 12:53:34,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-03-28 12:53:34,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:53:34,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-03-28 12:53:34,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:53:34,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:55, output treesize:29 [2018-03-28 12:53:34,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-03-28 12:53:34,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-03-28 12:53:34,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-03-28 12:53:34,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-03-28 12:53:34,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:11 [2018-03-28 12:53:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:34,188 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:34,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2018-03-28 12:53:34,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-03-28 12:53:34,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-03-28 12:53:34,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-03-28 12:53:34,380 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:53:34,395 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:72, output treesize:54 [2018-03-28 12:53:34,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-03-28 12:53:34,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-03-28 12:53:34,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:34,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:4 [2018-03-28 12:53:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:34,491 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:34,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2018-03-28 12:53:34,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-28 12:53:34,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-28 12:53:34,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-03-28 12:53:34,492 INFO L87 Difference]: Start difference. First operand 514 states and 626 transitions. Second operand 11 states. [2018-03-28 12:53:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:35,418 INFO L93 Difference]: Finished difference Result 1733 states and 2126 transitions. [2018-03-28 12:53:35,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-03-28 12:53:35,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-03-28 12:53:35,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:35,423 INFO L225 Difference]: With dead ends: 1733 [2018-03-28 12:53:35,423 INFO L226 Difference]: Without dead ends: 1732 [2018-03-28 12:53:35,423 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-03-28 12:53:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2018-03-28 12:53:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 513. [2018-03-28 12:53:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-03-28 12:53:35,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 625 transitions. [2018-03-28 12:53:35,453 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 625 transitions. Word has length 32 [2018-03-28 12:53:35,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:35,453 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 625 transitions. [2018-03-28 12:53:35,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-28 12:53:35,453 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 625 transitions. [2018-03-28 12:53:35,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-03-28 12:53:35,454 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:35,454 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:53:35,454 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:35,455 INFO L82 PathProgramCache]: Analyzing trace with hash -291272386, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:35,465 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:35,486 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:35,490 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:35,527 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:35,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:53:35,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-28 12:53:35,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-28 12:53:35,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 12:53:35,528 INFO L87 Difference]: Start difference. First operand 513 states and 625 transitions. Second operand 3 states. [2018-03-28 12:53:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:35,543 INFO L93 Difference]: Finished difference Result 783 states and 979 transitions. [2018-03-28 12:53:35,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-28 12:53:35,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-03-28 12:53:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:35,545 INFO L225 Difference]: With dead ends: 783 [2018-03-28 12:53:35,545 INFO L226 Difference]: Without dead ends: 517 [2018-03-28 12:53:35,546 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 12:53:35,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-03-28 12:53:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2018-03-28 12:53:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-03-28 12:53:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 629 transitions. [2018-03-28 12:53:35,571 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 629 transitions. Word has length 41 [2018-03-28 12:53:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:35,571 INFO L459 AbstractCegarLoop]: Abstraction has 517 states and 629 transitions. [2018-03-28 12:53:35,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-28 12:53:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 629 transitions. [2018-03-28 12:53:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-03-28 12:53:35,572 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:35,572 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-03-28 12:53:35,572 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:35,573 INFO L82 PathProgramCache]: Analyzing trace with hash 410589823, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:35,582 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:35,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:35,631 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:35,632 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:35,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:53:35,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-03-28 12:53:35,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:53:35,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:53:35,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-03-28 12:53:35,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-03-28 12:53:35,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:53:35,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:16 [2018-03-28 12:53:35,726 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:35,727 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:35,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:53:35,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-03-28 12:53:35,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-03-28 12:53:35,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:53:35,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-03-28 12:53:35,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:53:35,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,845 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,858 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2018-03-28 12:53:35,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-03-28 12:53:35,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:53:35,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-03-28 12:53:35,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:53:35,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:35,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:36,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:53:36,008 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:106, output treesize:80 [2018-03-28 12:53:36,040 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:36,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-03-28 12:53:36,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:36,073 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:36,074 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:36,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-03-28 12:53:36,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:36,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 12:53:36,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:84 [2018-03-28 12:53:36,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 58 [2018-03-28 12:53:36,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 29 [2018-03-28 12:53:36,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:36,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-03-28 12:53:36,133 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:36,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:36,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-03-28 12:53:36,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-03-28 12:53:36,154 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:36,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-03-28 12:53:36,160 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:36,164 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:36,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:53:36,172 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:102, output treesize:20 [2018-03-28 12:53:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:36,199 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:36,304 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:36,305 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:36,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-03-28 12:53:36,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:36,394 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:36,394 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:36,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-03-28 12:53:36,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:36,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:53:36,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:69 [2018-03-28 12:53:38,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2018-03-28 12:53:38,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:38,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 135 [2018-03-28 12:53:38,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:53:38,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 5 xjuncts. [2018-03-28 12:53:38,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:175, output treesize:627 [2018-03-28 12:53:50,708 WARN L151 SmtUtils]: Spent 10920ms on a formula simplification. DAG size of input: 143 DAG size of output 90 [2018-03-28 12:53:50,870 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 107 DAG size of output 98 [2018-03-28 12:53:50,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 84 [2018-03-28 12:53:50,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-03-28 12:53:50,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:50,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:50,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 84 [2018-03-28 12:53:50,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-03-28 12:53:50,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:50,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,005 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:51,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 145 [2018-03-28 12:53:51,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-03-28 12:53:51,034 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,044 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:51,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-03-28 12:53:51,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-03-28 12:53:51,047 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-03-28 12:53:51,052 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,053 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,058 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,142 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:51,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2018-03-28 12:53:51,196 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:51,196 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:51,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-03-28 12:53:51,197 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,200 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:51,200 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:51,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-03-28 12:53:51,201 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,203 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:51,203 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:51,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2018-03-28 12:53:51,205 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-03-28 12:53:51,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-03-28 12:53:51,219 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,221 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,226 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 95 [2018-03-28 12:53:51,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-03-28 12:53:51,335 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,382 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:51,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2018-03-28 12:53:51,383 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2018-03-28 12:53:51,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-03-28 12:53:51,430 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,452 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:51,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-03-28 12:53:51,453 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,465 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,488 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:51,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 3 dim-2 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2018-03-28 12:53:51,541 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 15 variables, input treesize:345, output treesize:273 [2018-03-28 12:53:55,487 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:55,487 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:53:55,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-03-28 12:53:55,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:55,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 73 [2018-03-28 12:53:55,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:53:55,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:55,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-03-28 12:53:55,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-03-28 12:53:55,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:55,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-03-28 12:53:55,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-03-28 12:53:55,587 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:55,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-03-28 12:53:55,594 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:55,597 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:55,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:55,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:55,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:55,611 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:160, output treesize:4 [2018-03-28 12:53:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:55,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:53:55,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-03-28 12:53:55,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-03-28 12:53:55,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-03-28 12:53:55,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=613, Unknown=2, NotChecked=0, Total=702 [2018-03-28 12:53:55,731 INFO L87 Difference]: Start difference. First operand 517 states and 629 transitions. Second operand 27 states. [2018-03-28 12:53:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:58,878 INFO L93 Difference]: Finished difference Result 1057 states and 1247 transitions. [2018-03-28 12:53:58,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-03-28 12:53:58,879 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2018-03-28 12:53:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:58,883 INFO L225 Difference]: With dead ends: 1057 [2018-03-28 12:53:58,883 INFO L226 Difference]: Without dead ends: 1055 [2018-03-28 12:53:58,884 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=450, Invalid=1528, Unknown=2, NotChecked=0, Total=1980 [2018-03-28 12:53:58,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-03-28 12:53:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 507. [2018-03-28 12:53:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-03-28 12:53:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 618 transitions. [2018-03-28 12:53:58,909 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 618 transitions. Word has length 41 [2018-03-28 12:53:58,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:58,910 INFO L459 AbstractCegarLoop]: Abstraction has 507 states and 618 transitions. [2018-03-28 12:53:58,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-03-28 12:53:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 618 transitions. [2018-03-28 12:53:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-03-28 12:53:58,911 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:58,911 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:53:58,911 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:58,911 INFO L82 PathProgramCache]: Analyzing trace with hash 422706307, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:58,924 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:58,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:58,959 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:58,986 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:58,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:53:58,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-28 12:53:58,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-28 12:53:58,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 12:53:58,987 INFO L87 Difference]: Start difference. First operand 507 states and 618 transitions. Second operand 3 states. [2018-03-28 12:53:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:59,007 INFO L93 Difference]: Finished difference Result 860 states and 1054 transitions. [2018-03-28 12:53:59,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-28 12:53:59,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-03-28 12:53:59,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:59,010 INFO L225 Difference]: With dead ends: 860 [2018-03-28 12:53:59,010 INFO L226 Difference]: Without dead ends: 590 [2018-03-28 12:53:59,011 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 12:53:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-03-28 12:53:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 517. [2018-03-28 12:53:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-03-28 12:53:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 630 transitions. [2018-03-28 12:53:59,033 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 630 transitions. Word has length 43 [2018-03-28 12:53:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:59,033 INFO L459 AbstractCegarLoop]: Abstraction has 517 states and 630 transitions. [2018-03-28 12:53:59,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-28 12:53:59,033 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 630 transitions. [2018-03-28 12:53:59,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-03-28 12:53:59,034 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:59,034 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-03-28 12:53:59,034 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:59,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2106783941, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:59,045 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:59,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:59,065 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:59,090 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:59,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:53:59,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-28 12:53:59,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-28 12:53:59,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 12:53:59,091 INFO L87 Difference]: Start difference. First operand 517 states and 630 transitions. Second operand 3 states. [2018-03-28 12:53:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:53:59,120 INFO L93 Difference]: Finished difference Result 1003 states and 1231 transitions. [2018-03-28 12:53:59,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-28 12:53:59,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-03-28 12:53:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:53:59,123 INFO L225 Difference]: With dead ends: 1003 [2018-03-28 12:53:59,123 INFO L226 Difference]: Without dead ends: 520 [2018-03-28 12:53:59,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 12:53:59,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-03-28 12:53:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2018-03-28 12:53:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-03-28 12:53:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 633 transitions. [2018-03-28 12:53:59,141 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 633 transitions. Word has length 44 [2018-03-28 12:53:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:53:59,141 INFO L459 AbstractCegarLoop]: Abstraction has 520 states and 633 transitions. [2018-03-28 12:53:59,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-28 12:53:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 633 transitions. [2018-03-28 12:53:59,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-03-28 12:53:59,142 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:53:59,143 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-03-28 12:53:59,143 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:53:59,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1818793448, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:53:59,152 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:53:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:53:59,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:53:59,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-28 12:53:59,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:53:59,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-28 12:53:59,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:53:59,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-03-28 12:53:59,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-03-28 12:53:59,258 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-03-28 12:53:59,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-03-28 12:53:59,276 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-03-28 12:53:59,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,298 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-03-28 12:53:59,312 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,313 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:53:59,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:40 [2018-03-28 12:53:59,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-03-28 12:53:59,355 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,357 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,358 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-03-28 12:53:59,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-03-28 12:53:59,389 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,390 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,391 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-03-28 12:53:59,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:52 [2018-03-28 12:53:59,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-03-28 12:53:59,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:53:59,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-03-28 12:53:59,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:53:59,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:98, output treesize:52 [2018-03-28 12:53:59,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-03-28 12:53:59,527 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,533 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,538 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-03-28 12:53:59,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-03-28 12:53:59,557 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,558 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,558 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:53:59,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-03-28 12:53:59,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,568 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:7 [2018-03-28 12:53:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:59,594 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:53:59,885 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-03-28 12:53:59,885 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 12 variables, input treesize:109, output treesize:1 [2018-03-28 12:53:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:53:59,913 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:53:59,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2018-03-28 12:53:59,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-03-28 12:53:59,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-03-28 12:53:59,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-03-28 12:53:59,914 INFO L87 Difference]: Start difference. First operand 520 states and 633 transitions. Second operand 16 states. [2018-03-28 12:54:00,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:00,733 INFO L93 Difference]: Finished difference Result 1390 states and 1643 transitions. [2018-03-28 12:54:00,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-03-28 12:54:00,733 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-03-28 12:54:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:00,736 INFO L225 Difference]: With dead ends: 1390 [2018-03-28 12:54:00,736 INFO L226 Difference]: Without dead ends: 904 [2018-03-28 12:54:00,737 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-03-28 12:54:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-03-28 12:54:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 556. [2018-03-28 12:54:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-03-28 12:54:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 675 transitions. [2018-03-28 12:54:00,753 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 675 transitions. Word has length 46 [2018-03-28 12:54:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:00,753 INFO L459 AbstractCegarLoop]: Abstraction has 556 states and 675 transitions. [2018-03-28 12:54:00,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-03-28 12:54:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 675 transitions. [2018-03-28 12:54:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-28 12:54:00,754 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:00,754 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:00,755 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:00,755 INFO L82 PathProgramCache]: Analyzing trace with hash 554894024, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:00,769 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:00,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:00,865 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:00,865 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:00,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-03-28 12:54:00,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:00,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:00,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-03-28 12:54:00,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:00,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:00,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:00,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:00,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:00,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-03-28 12:54:00,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-03-28 12:54:00,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:54:00,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:00,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:00,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:00,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:30 [2018-03-28 12:54:00,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:01,002 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:01,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-03-28 12:54:01,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:01,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:01,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:01,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:15 [2018-03-28 12:54:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:01,041 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:01,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-03-28 12:54:01,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:01,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:01,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-03-28 12:54:01,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-03-28 12:54:01,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:01,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:01,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-03-28 12:54:01,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:54:01,202 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:01,205 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:01,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 7 xjuncts. [2018-03-28 12:54:01,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-03-28 12:54:01,249 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:46, output treesize:79 [2018-03-28 12:54:01,342 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:01,342 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:01,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-03-28 12:54:01,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:01,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:01,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:3 [2018-03-28 12:54:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:01,380 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:01,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 11] imperfect sequences [] total 18 [2018-03-28 12:54:01,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-28 12:54:01,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-28 12:54:01,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-03-28 12:54:01,381 INFO L87 Difference]: Start difference. First operand 556 states and 675 transitions. Second operand 19 states. [2018-03-28 12:54:02,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:02,330 INFO L93 Difference]: Finished difference Result 864 states and 1033 transitions. [2018-03-28 12:54:02,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-03-28 12:54:02,330 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-03-28 12:54:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:02,333 INFO L225 Difference]: With dead ends: 864 [2018-03-28 12:54:02,333 INFO L226 Difference]: Without dead ends: 863 [2018-03-28 12:54:02,333 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-03-28 12:54:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-03-28 12:54:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 577. [2018-03-28 12:54:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-03-28 12:54:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 699 transitions. [2018-03-28 12:54:02,351 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 699 transitions. Word has length 47 [2018-03-28 12:54:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:02,352 INFO L459 AbstractCegarLoop]: Abstraction has 577 states and 699 transitions. [2018-03-28 12:54:02,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-28 12:54:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 699 transitions. [2018-03-28 12:54:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-28 12:54:02,353 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:02,353 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:02,353 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:02,353 INFO L82 PathProgramCache]: Analyzing trace with hash 554894025, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:02,360 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:02,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:02,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:54:02,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,395 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:02,396 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:02,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:54:02,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-03-28 12:54:02,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:02,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:02,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:02,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:02,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-03-28 12:54:02,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-03-28 12:54:02,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:54:02,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-03-28 12:54:02,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:54:02,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:80, output treesize:34 [2018-03-28 12:54:02,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:02,549 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:02,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-03-28 12:54:02,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-28 12:54:02,566 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:02,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-03-28 12:54:02,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:02,588 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:58, output treesize:9 [2018-03-28 12:54:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:02,605 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:04,742 WARN L148 SmtUtils]: Spent 2027ms on a formula simplification that was a NOOP. DAG size: 45 [2018-03-28 12:54:05,437 WARN L148 SmtUtils]: Spent 533ms on a formula simplification that was a NOOP. DAG size: 47 [2018-03-28 12:54:05,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 73 [2018-03-28 12:54:05,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:05,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-03-28 12:54:05,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:54:05,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-03-28 12:54:05,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2018-03-28 12:54:05,512 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-03-28 12:54:05,516 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:54:05,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-03-28 12:54:05,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-03-28 12:54:05,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:05,609 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-03-28 12:54:05,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2018-03-28 12:54:05,622 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:05,627 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:05,636 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:05,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-03-28 12:54:05,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:05,659 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-03-28 12:54:05,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2018-03-28 12:54:05,673 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:05,679 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:05,688 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:05,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-03-28 12:54:05,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:05,717 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-03-28 12:54:05,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:54:05,727 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,728 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,736 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-03-28 12:54:05,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:05,799 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-03-28 12:54:05,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-03-28 12:54:05,823 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-03-28 12:54:05,826 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:54:05,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-03-28 12:54:05,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:54:05,830 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,833 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,848 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-03-28 12:54:05,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-03-28 12:54:05,927 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 10 variables, input treesize:127, output treesize:68 [2018-03-28 12:54:05,989 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-28 12:54:05,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,994 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:05,995 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:05,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-03-28 12:54:05,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:05,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:3 [2018-03-28 12:54:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:06,036 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:06,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 11] imperfect sequences [] total 18 [2018-03-28 12:54:06,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-28 12:54:06,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-28 12:54:06,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-03-28 12:54:06,037 INFO L87 Difference]: Start difference. First operand 577 states and 699 transitions. Second operand 19 states. [2018-03-28 12:54:08,482 WARN L151 SmtUtils]: Spent 2125ms on a formula simplification. DAG size of input: 78 DAG size of output 77 [2018-03-28 12:54:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:09,403 INFO L93 Difference]: Finished difference Result 1204 states and 1405 transitions. [2018-03-28 12:54:09,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-03-28 12:54:09,404 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-03-28 12:54:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:09,407 INFO L225 Difference]: With dead ends: 1204 [2018-03-28 12:54:09,407 INFO L226 Difference]: Without dead ends: 1202 [2018-03-28 12:54:09,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=269, Invalid=991, Unknown=0, NotChecked=0, Total=1260 [2018-03-28 12:54:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2018-03-28 12:54:09,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 587. [2018-03-28 12:54:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-03-28 12:54:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 711 transitions. [2018-03-28 12:54:09,432 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 711 transitions. Word has length 47 [2018-03-28 12:54:09,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:09,433 INFO L459 AbstractCegarLoop]: Abstraction has 587 states and 711 transitions. [2018-03-28 12:54:09,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-28 12:54:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 711 transitions. [2018-03-28 12:54:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-28 12:54:09,433 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:09,433 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:09,433 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:09,434 INFO L82 PathProgramCache]: Analyzing trace with hash -889237438, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:09,439 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:09,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:09,458 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:09,483 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:09,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:54:09,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-28 12:54:09,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-28 12:54:09,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 12:54:09,484 INFO L87 Difference]: Start difference. First operand 587 states and 711 transitions. Second operand 3 states. [2018-03-28 12:54:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:09,515 INFO L93 Difference]: Finished difference Result 1077 states and 1317 transitions. [2018-03-28 12:54:09,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-28 12:54:09,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-03-28 12:54:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:09,517 INFO L225 Difference]: With dead ends: 1077 [2018-03-28 12:54:09,517 INFO L226 Difference]: Without dead ends: 591 [2018-03-28 12:54:09,518 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 12:54:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-03-28 12:54:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2018-03-28 12:54:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-03-28 12:54:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 715 transitions. [2018-03-28 12:54:09,535 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 715 transitions. Word has length 47 [2018-03-28 12:54:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:09,535 INFO L459 AbstractCegarLoop]: Abstraction has 591 states and 715 transitions. [2018-03-28 12:54:09,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-28 12:54:09,535 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 715 transitions. [2018-03-28 12:54:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-03-28 12:54:09,536 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:09,536 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-03-28 12:54:09,536 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:09,536 INFO L82 PathProgramCache]: Analyzing trace with hash -750522098, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:09,542 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:09,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:09,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-28 12:54:09,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:54:09,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-28 12:54:09,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:54:09,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,583 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-03-28 12:54:09,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-03-28 12:54:09,605 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-03-28 12:54:09,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-03-28 12:54:09,625 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-03-28 12:54:09,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,630 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-03-28 12:54:09,653 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,654 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:54:09,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-03-28 12:54:09,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-03-28 12:54:09,683 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,684 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,685 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-03-28 12:54:09,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-03-28 12:54:09,713 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,714 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,714 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-03-28 12:54:09,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,734 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:49 [2018-03-28 12:54:09,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-03-28 12:54:09,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:54:09,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-03-28 12:54:09,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:54:09,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:49 [2018-03-28 12:54:09,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-03-28 12:54:09,843 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,843 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,844 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-03-28 12:54:09,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-03-28 12:54:09,860 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:09,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-03-28 12:54:09,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:09,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:7 [2018-03-28 12:54:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:09,890 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:10,140 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:10,140 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 11 variables, input treesize:117, output treesize:1 [2018-03-28 12:54:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:10,166 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:10,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 18 [2018-03-28 12:54:10,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-03-28 12:54:10,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-03-28 12:54:10,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-03-28 12:54:10,168 INFO L87 Difference]: Start difference. First operand 591 states and 715 transitions. Second operand 18 states. [2018-03-28 12:54:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:11,781 INFO L93 Difference]: Finished difference Result 1106 states and 1292 transitions. [2018-03-28 12:54:11,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-03-28 12:54:11,781 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-03-28 12:54:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:11,784 INFO L225 Difference]: With dead ends: 1106 [2018-03-28 12:54:11,784 INFO L226 Difference]: Without dead ends: 903 [2018-03-28 12:54:11,785 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=391, Invalid=1169, Unknown=0, NotChecked=0, Total=1560 [2018-03-28 12:54:11,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-03-28 12:54:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 658. [2018-03-28 12:54:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-03-28 12:54:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 807 transitions. [2018-03-28 12:54:11,802 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 807 transitions. Word has length 48 [2018-03-28 12:54:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:11,803 INFO L459 AbstractCegarLoop]: Abstraction has 658 states and 807 transitions. [2018-03-28 12:54:11,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-03-28 12:54:11,803 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 807 transitions. [2018-03-28 12:54:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-03-28 12:54:11,803 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:11,803 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:11,803 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:11,804 INFO L82 PathProgramCache]: Analyzing trace with hash -454294459, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:11,809 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:11,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:11,848 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:11,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-03-28 12:54:11,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:11,858 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:11,859 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:11,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:54:11,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:11,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:11,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-03-28 12:54:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:11,877 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:11,975 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:11,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-03-28 12:54:11,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-28 12:54:11,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-28 12:54:11,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-03-28 12:54:11,976 INFO L87 Difference]: Start difference. First operand 658 states and 807 transitions. Second operand 10 states. [2018-03-28 12:54:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:12,544 INFO L93 Difference]: Finished difference Result 1068 states and 1294 transitions. [2018-03-28 12:54:12,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-28 12:54:12,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-03-28 12:54:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:12,549 INFO L225 Difference]: With dead ends: 1068 [2018-03-28 12:54:12,549 INFO L226 Difference]: Without dead ends: 1060 [2018-03-28 12:54:12,549 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2018-03-28 12:54:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2018-03-28 12:54:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 715. [2018-03-28 12:54:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-03-28 12:54:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 876 transitions. [2018-03-28 12:54:12,573 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 876 transitions. Word has length 49 [2018-03-28 12:54:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:12,573 INFO L459 AbstractCegarLoop]: Abstraction has 715 states and 876 transitions. [2018-03-28 12:54:12,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-28 12:54:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 876 transitions. [2018-03-28 12:54:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-28 12:54:12,574 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:12,575 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-03-28 12:54:12,575 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:12,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1942959657, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:12,583 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:12,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:12,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-03-28 12:54:12,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-03-28 12:54:12,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:12,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:12,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-03-28 12:54:12,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-03-28 12:54:12,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:12,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:12,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:12,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-03-28 12:54:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:12,649 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:12,701 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:12,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2018-03-28 12:54:12,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-28 12:54:12,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-28 12:54:12,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-03-28 12:54:12,702 INFO L87 Difference]: Start difference. First operand 715 states and 876 transitions. Second operand 8 states. [2018-03-28 12:54:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:12,991 INFO L93 Difference]: Finished difference Result 1214 states and 1519 transitions. [2018-03-28 12:54:12,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-28 12:54:12,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-03-28 12:54:12,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:12,994 INFO L225 Difference]: With dead ends: 1214 [2018-03-28 12:54:12,994 INFO L226 Difference]: Without dead ends: 867 [2018-03-28 12:54:12,995 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-03-28 12:54:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-03-28 12:54:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 751. [2018-03-28 12:54:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-03-28 12:54:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 911 transitions. [2018-03-28 12:54:13,015 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 911 transitions. Word has length 50 [2018-03-28 12:54:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:13,016 INFO L459 AbstractCegarLoop]: Abstraction has 751 states and 911 transitions. [2018-03-28 12:54:13,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-28 12:54:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 911 transitions. [2018-03-28 12:54:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-28 12:54:13,016 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:13,016 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-03-28 12:54:13,016 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:13,017 INFO L82 PathProgramCache]: Analyzing trace with hash 689721905, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:13,026 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:13,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:13,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:13,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:13,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:13,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:13,077 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-03-28 12:54:13,093 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:13,094 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:13,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:54:13,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-03-28 12:54:13,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-03-28 12:54:13,118 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:13,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-03-28 12:54:13,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-03-28 12:54:13,138 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:13,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-03-28 12:54:13,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,151 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:32 [2018-03-28 12:54:13,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-03-28 12:54:13,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:54:13,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-03-28 12:54:13,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:54:13,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:78, output treesize:32 [2018-03-28 12:54:13,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-03-28 12:54:13,260 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:13,261 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:13,261 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:13,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 31 [2018-03-28 12:54:13,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-28 12:54:13,282 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:13,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-03-28 12:54:13,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:13,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:56, output treesize:7 [2018-03-28 12:54:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:13,323 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:16,918 WARN L148 SmtUtils]: Spent 2015ms on a formula simplification that was a NOOP. DAG size: 39 [2018-03-28 12:54:19,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-03-28 12:54:19,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-03-28 12:54:19,181 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-03-28 12:54:19,183 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-03-28 12:54:19,191 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2018-03-28 12:54:19,193 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,199 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-03-28 12:54:19,232 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-03-28 12:54:19,233 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,235 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,235 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-03-28 12:54:19,237 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,249 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-28 12:54:19,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-03-28 12:54:19,267 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,268 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-03-28 12:54:19,271 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,277 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:54:19,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-03-28 12:54:19,281 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,281 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-03-28 12:54:19,283 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,295 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-03-28 12:54:19,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-03-28 12:54:19,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-03-28 12:54:19,365 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-03-28 12:54:19,366 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,371 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-03-28 12:54:19,375 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2018-03-28 12:54:19,376 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,382 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-03-28 12:54:19,419 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,420 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-03-28 12:54:19,422 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,429 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:54:19,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-03-28 12:54:19,432 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,432 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-03-28 12:54:19,434 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,438 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-03-28 12:54:19,453 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,453 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-03-28 12:54:19,456 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,457 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-03-28 12:54:19,459 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,471 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-28 12:54:19,488 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-03-28 12:54:19,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-03-28 12:54:19,536 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 11 variables, input treesize:121, output treesize:69 [2018-03-28 12:54:19,573 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:19,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-03-28 12:54:19,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:19,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-03-28 12:54:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:19,611 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:19,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 14] imperfect sequences [] total 21 [2018-03-28 12:54:19,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-28 12:54:19,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-28 12:54:19,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=353, Unknown=2, NotChecked=0, Total=420 [2018-03-28 12:54:19,612 INFO L87 Difference]: Start difference. First operand 751 states and 911 transitions. Second operand 21 states. [2018-03-28 12:54:20,292 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 111 DAG size of output 65 [2018-03-28 12:54:20,618 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 87 DAG size of output 61 [2018-03-28 12:54:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:21,526 INFO L93 Difference]: Finished difference Result 1216 states and 1458 transitions. [2018-03-28 12:54:21,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-03-28 12:54:21,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-03-28 12:54:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:21,529 INFO L225 Difference]: With dead ends: 1216 [2018-03-28 12:54:21,529 INFO L226 Difference]: Without dead ends: 922 [2018-03-28 12:54:21,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=333, Invalid=997, Unknown=2, NotChecked=0, Total=1332 [2018-03-28 12:54:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2018-03-28 12:54:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 678. [2018-03-28 12:54:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2018-03-28 12:54:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 812 transitions. [2018-03-28 12:54:21,547 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 812 transitions. Word has length 50 [2018-03-28 12:54:21,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:21,547 INFO L459 AbstractCegarLoop]: Abstraction has 678 states and 812 transitions. [2018-03-28 12:54:21,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-28 12:54:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 812 transitions. [2018-03-28 12:54:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-28 12:54:21,547 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:21,548 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:21,548 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:21,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1198226215, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:21,553 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:21,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:21,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:54:21,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:21,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:21,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 12:54:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:21,582 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:21,613 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:21,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:54:21,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-28 12:54:21,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-28 12:54:21,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-28 12:54:21,614 INFO L87 Difference]: Start difference. First operand 678 states and 812 transitions. Second operand 4 states. [2018-03-28 12:54:21,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:21,850 INFO L93 Difference]: Finished difference Result 1846 states and 2222 transitions. [2018-03-28 12:54:21,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-28 12:54:21,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-03-28 12:54:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:21,855 INFO L225 Difference]: With dead ends: 1846 [2018-03-28 12:54:21,855 INFO L226 Difference]: Without dead ends: 1841 [2018-03-28 12:54:21,856 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-28 12:54:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2018-03-28 12:54:21,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 675. [2018-03-28 12:54:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-03-28 12:54:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 810 transitions. [2018-03-28 12:54:21,875 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 810 transitions. Word has length 50 [2018-03-28 12:54:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:21,875 INFO L459 AbstractCegarLoop]: Abstraction has 675 states and 810 transitions. [2018-03-28 12:54:21,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-28 12:54:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 810 transitions. [2018-03-28 12:54:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-28 12:54:21,876 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:21,876 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:21,876 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:21,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1198226214, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:21,886 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:21,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:21,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:54:21,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:21,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:21,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:54:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:21,920 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:21,955 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:21,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-28 12:54:21,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 12:54:21,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 12:54:21,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-28 12:54:21,956 INFO L87 Difference]: Start difference. First operand 675 states and 810 transitions. Second operand 6 states. [2018-03-28 12:54:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:22,269 INFO L93 Difference]: Finished difference Result 1315 states and 1576 transitions. [2018-03-28 12:54:22,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-28 12:54:22,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-03-28 12:54:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:22,273 INFO L225 Difference]: With dead ends: 1315 [2018-03-28 12:54:22,273 INFO L226 Difference]: Without dead ends: 1313 [2018-03-28 12:54:22,273 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-03-28 12:54:22,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2018-03-28 12:54:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 676. [2018-03-28 12:54:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-03-28 12:54:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 810 transitions. [2018-03-28 12:54:22,291 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 810 transitions. Word has length 50 [2018-03-28 12:54:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:22,292 INFO L459 AbstractCegarLoop]: Abstraction has 676 states and 810 transitions. [2018-03-28 12:54:22,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 12:54:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 810 transitions. [2018-03-28 12:54:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-03-28 12:54:22,292 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:22,292 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:22,292 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash 520103340, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:22,299 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:22,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:22,329 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:22,330 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:22,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:54:22,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-03-28 12:54:22,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:22,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:22,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:22,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:22,352 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-03-28 12:54:22,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-03-28 12:54:22,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-03-28 12:54:22,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-03-28 12:54:22,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-03-28 12:54:22,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:54:22,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2018-03-28 12:54:22,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-28 12:54:22,443 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:22,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-03-28 12:54:22,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-03-28 12:54:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:22,463 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:22,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-03-28 12:54:22,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:22,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-03-28 12:54:22,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:54:22,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:22,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-03-28 12:54:22,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-03-28 12:54:22,605 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-03-28 12:54:22,607 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:54:22,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-03-28 12:54:22,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-03-28 12:54:22,640 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:44, output treesize:43 [2018-03-28 12:54:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:22,716 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:22,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 18 [2018-03-28 12:54:22,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-28 12:54:22,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-28 12:54:22,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-03-28 12:54:22,717 INFO L87 Difference]: Start difference. First operand 676 states and 810 transitions. Second operand 19 states. [2018-03-28 12:54:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:23,574 INFO L93 Difference]: Finished difference Result 950 states and 1095 transitions. [2018-03-28 12:54:23,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-03-28 12:54:23,574 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-03-28 12:54:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:23,577 INFO L225 Difference]: With dead ends: 950 [2018-03-28 12:54:23,577 INFO L226 Difference]: Without dead ends: 949 [2018-03-28 12:54:23,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2018-03-28 12:54:23,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-03-28 12:54:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 676. [2018-03-28 12:54:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-03-28 12:54:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 809 transitions. [2018-03-28 12:54:23,595 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 809 transitions. Word has length 53 [2018-03-28 12:54:23,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:23,595 INFO L459 AbstractCegarLoop]: Abstraction has 676 states and 809 transitions. [2018-03-28 12:54:23,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-28 12:54:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 809 transitions. [2018-03-28 12:54:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-03-28 12:54:23,595 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:23,595 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:23,596 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:23,596 INFO L82 PathProgramCache]: Analyzing trace with hash 668019565, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:23,601 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:23,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:23,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-03-28 12:54:23,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-03-28 12:54:23,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:23,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:23,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:23,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-03-28 12:54:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:23,640 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:23,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-03-28 12:54:23,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:23,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:23,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2018-03-28 12:54:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:23,666 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:23,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-03-28 12:54:23,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-28 12:54:23,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-28 12:54:23,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-28 12:54:23,667 INFO L87 Difference]: Start difference. First operand 676 states and 809 transitions. Second operand 5 states. [2018-03-28 12:54:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:23,819 INFO L93 Difference]: Finished difference Result 676 states and 809 transitions. [2018-03-28 12:54:23,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 12:54:23,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-03-28 12:54:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:23,821 INFO L225 Difference]: With dead ends: 676 [2018-03-28 12:54:23,821 INFO L226 Difference]: Without dead ends: 675 [2018-03-28 12:54:23,821 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-03-28 12:54:23,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-03-28 12:54:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2018-03-28 12:54:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-03-28 12:54:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 806 transitions. [2018-03-28 12:54:23,838 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 806 transitions. Word has length 53 [2018-03-28 12:54:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:23,838 INFO L459 AbstractCegarLoop]: Abstraction has 675 states and 806 transitions. [2018-03-28 12:54:23,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-28 12:54:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 806 transitions. [2018-03-28 12:54:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-03-28 12:54:23,838 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:23,838 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:23,838 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:23,839 INFO L82 PathProgramCache]: Analyzing trace with hash 668019566, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:23,844 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:23,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:23,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-03-28 12:54:23,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-03-28 12:54:23,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:23,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:23,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-03-28 12:54:23,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-03-28 12:54:23,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:23,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:23,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:23,898 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:11 [2018-03-28 12:54:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:23,905 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:23,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-03-28 12:54:23,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:23,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2018-03-28 12:54:23,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 12:54:23,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-28 12:54:23,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2018-03-28 12:54:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:23,967 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:23,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-03-28 12:54:23,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 12:54:23,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 12:54:23,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-03-28 12:54:23,968 INFO L87 Difference]: Start difference. First operand 675 states and 806 transitions. Second operand 6 states. [2018-03-28 12:54:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:24,150 INFO L93 Difference]: Finished difference Result 675 states and 806 transitions. [2018-03-28 12:54:24,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 12:54:24,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-03-28 12:54:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:24,153 INFO L225 Difference]: With dead ends: 675 [2018-03-28 12:54:24,153 INFO L226 Difference]: Without dead ends: 674 [2018-03-28 12:54:24,153 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-03-28 12:54:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-03-28 12:54:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2018-03-28 12:54:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-03-28 12:54:24,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 803 transitions. [2018-03-28 12:54:24,170 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 803 transitions. Word has length 53 [2018-03-28 12:54:24,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:24,170 INFO L459 AbstractCegarLoop]: Abstraction has 674 states and 803 transitions. [2018-03-28 12:54:24,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 12:54:24,170 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 803 transitions. [2018-03-28 12:54:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-03-28 12:54:24,171 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:24,171 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:24,171 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:24,171 INFO L82 PathProgramCache]: Analyzing trace with hash -883815031, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:24,177 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:24,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:24,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:54:24,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:24,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:24,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:54:24,222 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:24,223 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:24,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-03-28 12:54:24,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:24,232 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:24,233 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:24,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:54:24,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:24,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:24,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-03-28 12:54:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:24,248 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:24,294 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:24,294 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:24,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-03-28 12:54:24,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:24,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:24,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2018-03-28 12:54:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:24,348 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:24,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2018-03-28 12:54:24,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-28 12:54:24,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-28 12:54:24,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-03-28 12:54:24,349 INFO L87 Difference]: Start difference. First operand 674 states and 803 transitions. Second operand 12 states. [2018-03-28 12:54:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:24,982 INFO L93 Difference]: Finished difference Result 2000 states and 2427 transitions. [2018-03-28 12:54:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-28 12:54:24,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-03-28 12:54:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:24,988 INFO L225 Difference]: With dead ends: 2000 [2018-03-28 12:54:24,988 INFO L226 Difference]: Without dead ends: 1997 [2018-03-28 12:54:24,988 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-03-28 12:54:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2018-03-28 12:54:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 674. [2018-03-28 12:54:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-03-28 12:54:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 803 transitions. [2018-03-28 12:54:25,016 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 803 transitions. Word has length 53 [2018-03-28 12:54:25,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:25,016 INFO L459 AbstractCegarLoop]: Abstraction has 674 states and 803 transitions. [2018-03-28 12:54:25,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-28 12:54:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 803 transitions. [2018-03-28 12:54:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-28 12:54:25,017 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:25,017 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:25,017 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:25,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1056665219, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:25,024 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:25,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:25,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-03-28 12:54:25,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-03-28 12:54:25,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-03-28 12:54:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:25,055 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:25,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-03-28 12:54:25,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2018-03-28 12:54:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:25,083 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:25,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-03-28 12:54:25,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-28 12:54:25,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-28 12:54:25,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-28 12:54:25,084 INFO L87 Difference]: Start difference. First operand 674 states and 803 transitions. Second operand 5 states. [2018-03-28 12:54:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:25,243 INFO L93 Difference]: Finished difference Result 674 states and 803 transitions. [2018-03-28 12:54:25,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 12:54:25,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-03-28 12:54:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:25,277 INFO L225 Difference]: With dead ends: 674 [2018-03-28 12:54:25,277 INFO L226 Difference]: Without dead ends: 673 [2018-03-28 12:54:25,277 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-03-28 12:54:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-03-28 12:54:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2018-03-28 12:54:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-03-28 12:54:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 799 transitions. [2018-03-28 12:54:25,295 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 799 transitions. Word has length 54 [2018-03-28 12:54:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:25,296 INFO L459 AbstractCegarLoop]: Abstraction has 673 states and 799 transitions. [2018-03-28 12:54:25,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-28 12:54:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 799 transitions. [2018-03-28 12:54:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-28 12:54:25,296 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:25,296 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:25,296 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:25,297 INFO L82 PathProgramCache]: Analyzing trace with hash 839258845, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:25,302 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:25,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:25,322 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:25,345 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:25,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:54:25,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-28 12:54:25,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-28 12:54:25,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 12:54:25,346 INFO L87 Difference]: Start difference. First operand 673 states and 799 transitions. Second operand 3 states. [2018-03-28 12:54:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:25,365 INFO L93 Difference]: Finished difference Result 1249 states and 1498 transitions. [2018-03-28 12:54:25,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-28 12:54:25,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-03-28 12:54:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:25,367 INFO L225 Difference]: With dead ends: 1249 [2018-03-28 12:54:25,368 INFO L226 Difference]: Without dead ends: 678 [2018-03-28 12:54:25,368 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 12:54:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-03-28 12:54:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2018-03-28 12:54:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-03-28 12:54:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 802 transitions. [2018-03-28 12:54:25,386 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 802 transitions. Word has length 55 [2018-03-28 12:54:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:25,386 INFO L459 AbstractCegarLoop]: Abstraction has 676 states and 802 transitions. [2018-03-28 12:54:25,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-28 12:54:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 802 transitions. [2018-03-28 12:54:25,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-03-28 12:54:25,387 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:25,387 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:25,387 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:25,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1583927902, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:25,393 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:25,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:25,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:54:25,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 12:54:25,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:25,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:25,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-03-28 12:54:25,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-03-28 12:54:25,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-03-28 12:54:25,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-03-28 12:54:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:25,438 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:25,461 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:25,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-03-28 12:54:25,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-28 12:54:25,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-28 12:54:25,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-28 12:54:25,462 INFO L87 Difference]: Start difference. First operand 676 states and 802 transitions. Second operand 5 states. [2018-03-28 12:54:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:25,671 INFO L93 Difference]: Finished difference Result 1008 states and 1193 transitions. [2018-03-28 12:54:25,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 12:54:25,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-03-28 12:54:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:25,673 INFO L225 Difference]: With dead ends: 1008 [2018-03-28 12:54:25,673 INFO L226 Difference]: Without dead ends: 1007 [2018-03-28 12:54:25,674 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-03-28 12:54:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2018-03-28 12:54:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 675. [2018-03-28 12:54:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-03-28 12:54:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 801 transitions. [2018-03-28 12:54:25,694 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 801 transitions. Word has length 56 [2018-03-28 12:54:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:25,694 INFO L459 AbstractCegarLoop]: Abstraction has 675 states and 801 transitions. [2018-03-28 12:54:25,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-28 12:54:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 801 transitions. [2018-03-28 12:54:25,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-03-28 12:54:25,695 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:25,695 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:25,695 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:25,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1583927901, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:25,701 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:25,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:25,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:54:25,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:54:25,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:25,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:25,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:25,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:25,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-03-28 12:54:25,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-03-28 12:54:25,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-03-28 12:54:25,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-28 12:54:25,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-03-28 12:54:25,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:25,825 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-03-28 12:54:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:25,832 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:25,875 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:25,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-03-28 12:54:25,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-28 12:54:25,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-28 12:54:25,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-03-28 12:54:25,876 INFO L87 Difference]: Start difference. First operand 675 states and 801 transitions. Second operand 8 states. [2018-03-28 12:54:26,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:26,208 INFO L93 Difference]: Finished difference Result 1018 states and 1202 transitions. [2018-03-28 12:54:26,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-28 12:54:26,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-03-28 12:54:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:26,210 INFO L225 Difference]: With dead ends: 1018 [2018-03-28 12:54:26,210 INFO L226 Difference]: Without dead ends: 1017 [2018-03-28 12:54:26,210 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-03-28 12:54:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-03-28 12:54:26,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 674. [2018-03-28 12:54:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-03-28 12:54:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 800 transitions. [2018-03-28 12:54:26,230 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 800 transitions. Word has length 56 [2018-03-28 12:54:26,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:26,230 INFO L459 AbstractCegarLoop]: Abstraction has 674 states and 800 transitions. [2018-03-28 12:54:26,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-28 12:54:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 800 transitions. [2018-03-28 12:54:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-03-28 12:54:26,230 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:26,231 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:26,231 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2084779898, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:26,236 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:26,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:26,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:54:26,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 12:54:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:26,263 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:26,286 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:26,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 12:54:26,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-28 12:54:26,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-28 12:54:26,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-28 12:54:26,286 INFO L87 Difference]: Start difference. First operand 674 states and 800 transitions. Second operand 4 states. [2018-03-28 12:54:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:26,517 INFO L93 Difference]: Finished difference Result 1821 states and 2167 transitions. [2018-03-28 12:54:26,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-28 12:54:26,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-03-28 12:54:26,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:26,519 INFO L225 Difference]: With dead ends: 1821 [2018-03-28 12:54:26,519 INFO L226 Difference]: Without dead ends: 1820 [2018-03-28 12:54:26,519 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-28 12:54:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2018-03-28 12:54:26,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 673. [2018-03-28 12:54:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-03-28 12:54:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 799 transitions. [2018-03-28 12:54:26,541 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 799 transitions. Word has length 57 [2018-03-28 12:54:26,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:26,541 INFO L459 AbstractCegarLoop]: Abstraction has 673 states and 799 transitions. [2018-03-28 12:54:26,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-28 12:54:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 799 transitions. [2018-03-28 12:54:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-03-28 12:54:26,542 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:26,542 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:26,542 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:26,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2084779899, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:26,548 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:26,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:26,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-03-28 12:54:26,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-03-28 12:54:26,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-03-28 12:54:26,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-03-28 12:54:26,601 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-03-28 12:54:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:26,615 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:26,664 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:26,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2018-03-28 12:54:26,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-28 12:54:26,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-28 12:54:26,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-03-28 12:54:26,665 INFO L87 Difference]: Start difference. First operand 673 states and 799 transitions. Second operand 9 states. [2018-03-28 12:54:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:26,888 INFO L93 Difference]: Finished difference Result 1441 states and 1711 transitions. [2018-03-28 12:54:26,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-28 12:54:26,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-03-28 12:54:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:26,889 INFO L225 Difference]: With dead ends: 1441 [2018-03-28 12:54:26,889 INFO L226 Difference]: Without dead ends: 807 [2018-03-28 12:54:26,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-03-28 12:54:26,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-03-28 12:54:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 700. [2018-03-28 12:54:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-03-28 12:54:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 825 transitions. [2018-03-28 12:54:26,910 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 825 transitions. Word has length 57 [2018-03-28 12:54:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:26,910 INFO L459 AbstractCegarLoop]: Abstraction has 700 states and 825 transitions. [2018-03-28 12:54:26,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-28 12:54:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 825 transitions. [2018-03-28 12:54:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-03-28 12:54:26,911 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:26,911 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:26,911 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:26,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1577211488, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:26,917 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:26,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:26,947 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:26,947 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:26,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:54:26,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-28 12:54:26,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:26,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:26,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-03-28 12:54:26,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-03-28 12:54:26,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:54:26,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:26,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:14 [2018-03-28 12:54:27,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-03-28 12:54:27,017 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:27,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-03-28 12:54:27,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:27,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:27,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:27,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:10 [2018-03-28 12:54:27,034 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:27,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-03-28 12:54:27,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:27,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:27,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-03-28 12:54:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:27,063 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:27,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-03-28 12:54:27,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:27,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:27,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-03-28 12:54:27,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-03-28 12:54:27,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-03-28 12:54:27,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:27,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:54:27,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:54:27,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:16 [2018-03-28 12:54:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:27,243 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:27,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 18 [2018-03-28 12:54:27,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-28 12:54:27,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-28 12:54:27,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-03-28 12:54:27,244 INFO L87 Difference]: Start difference. First operand 700 states and 825 transitions. Second operand 19 states. [2018-03-28 12:54:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:28,112 INFO L93 Difference]: Finished difference Result 968 states and 1105 transitions. [2018-03-28 12:54:28,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-03-28 12:54:28,113 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-03-28 12:54:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:28,114 INFO L225 Difference]: With dead ends: 968 [2018-03-28 12:54:28,114 INFO L226 Difference]: Without dead ends: 967 [2018-03-28 12:54:28,115 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=976, Unknown=0, NotChecked=0, Total=1260 [2018-03-28 12:54:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-03-28 12:54:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 701. [2018-03-28 12:54:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-03-28 12:54:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 826 transitions. [2018-03-28 12:54:28,137 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 826 transitions. Word has length 58 [2018-03-28 12:54:28,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:28,137 INFO L459 AbstractCegarLoop]: Abstraction has 701 states and 826 transitions. [2018-03-28 12:54:28,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-28 12:54:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 826 transitions. [2018-03-28 12:54:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-03-28 12:54:28,138 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:28,138 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:28,138 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:28,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1079880200, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:28,144 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:28,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:28,176 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:28,176 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:28,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-03-28 12:54:28,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-03-28 12:54:28,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:28,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:28,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:28,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:28,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:30 [2018-03-28 12:54:28,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-03-28 12:54:28,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-03-28 12:54:28,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-03-28 12:54:28,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-03-28 12:54:28,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:55 [2018-03-28 12:54:28,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-03-28 12:54:28,359 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:28,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-03-28 12:54:28,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:28,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:64 [2018-03-28 12:54:28,406 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:28,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-03-28 12:54:28,411 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:28,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2018-03-28 12:54:28,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-03-28 12:54:28,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:28,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:28,435 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:68, output treesize:15 [2018-03-28 12:54:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:28,502 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:33,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 77 [2018-03-28 12:54:33,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:33,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:33,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 73 treesize of output 112 [2018-03-28 12:54:33,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2018-03-28 12:54:33,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:33,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 123 [2018-03-28 12:54:33,264 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:33,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 86 [2018-03-28 12:54:33,385 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:33,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 174 [2018-03-28 12:54:33,521 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-03-28 12:54:33,658 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:33,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 90 [2018-03-28 12:54:33,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 100 [2018-03-28 12:54:33,754 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:33,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 156 [2018-03-28 12:54:33,803 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-28 12:54:33,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 97 [2018-03-28 12:54:33,883 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:33,891 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:33,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:33,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 99 [2018-03-28 12:54:33,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 81 [2018-03-28 12:54:33,938 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:33,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 80 [2018-03-28 12:54:33,968 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:34,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 82 [2018-03-28 12:54:34,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 113 [2018-03-28 12:54:34,018 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-28 12:54:34,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 94 [2018-03-28 12:54:34,063 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:34,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-03-28 12:54:34,064 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:34,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-03-28 12:54:34,066 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:34,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 64 [2018-03-28 12:54:34,105 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:34,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-03-28 12:54:34,140 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:34,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 16 [2018-03-28 12:54:34,174 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:34,205 INFO L267 ElimStorePlain]: Start of recursive call 16: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-03-28 12:54:34,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 88 [2018-03-28 12:54:34,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 58 [2018-03-28 12:54:34,271 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:34,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-03-28 12:54:34,304 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:34,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 16 [2018-03-28 12:54:34,334 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:34,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 107 [2018-03-28 12:54:34,374 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-28 12:54:34,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 151 [2018-03-28 12:54:34,449 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-28 12:54:34,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 18 [2018-03-28 12:54:34,525 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:34,595 INFO L267 ElimStorePlain]: Start of recursive call 24: 6 dim-1 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-03-28 12:54:34,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 82 [2018-03-28 12:54:34,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 5 [2018-03-28 12:54:34,709 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:34,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-03-28 12:54:34,718 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:34,722 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:34,825 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 10 dim-0 vars, and 12 xjuncts. [2018-03-28 12:54:34,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 105 treesize of output 144 [2018-03-28 12:54:34,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 118 [2018-03-28 12:54:34,865 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:35,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 113 [2018-03-28 12:54:35,003 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:35,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 117 [2018-03-28 12:54:35,127 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:35,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 112 [2018-03-28 12:54:35,245 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:35,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 105 [2018-03-28 12:54:35,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 131 [2018-03-28 12:54:35,382 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:35,397 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:35,526 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:35,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 122 [2018-03-28 12:54:35,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 90 [2018-03-28 12:54:35,546 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:35,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 144 [2018-03-28 12:54:35,599 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-28 12:54:35,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 87 [2018-03-28 12:54:35,667 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:35,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 146 [2018-03-28 12:54:35,739 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-28 12:54:35,806 INFO L267 ElimStorePlain]: Start of recursive call 41: 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-03-28 12:54:35,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 104 [2018-03-28 12:54:35,999 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:35,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-03-28 12:54:36,000 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:36,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2018-03-28 12:54:36,010 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:36,014 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:36,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 119 [2018-03-28 12:54:36,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 97 [2018-03-28 12:54:36,204 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:36,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 74 [2018-03-28 12:54:36,227 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:36,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 65 [2018-03-28 12:54:36,249 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:36,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-03-28 12:54:36,268 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:36,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 144 [2018-03-28 12:54:36,299 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-28 12:54:36,338 INFO L267 ElimStorePlain]: Start of recursive call 49: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-03-28 12:54:36,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 110 [2018-03-28 12:54:36,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 131 [2018-03-28 12:54:36,565 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:36,591 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:36,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 141 [2018-03-28 12:54:36,602 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:36,631 INFO L267 ElimStorePlain]: Start of recursive call 55: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-28 12:54:36,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 121 [2018-03-28 12:54:36,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 61 [2018-03-28 12:54:36,848 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:36,887 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:36,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2018-03-28 12:54:36,898 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:36,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 68 [2018-03-28 12:54:36,934 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:36,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 90 [2018-03-28 12:54:36,974 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:37,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2018-03-28 12:54:37,012 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:37,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 144 [2018-03-28 12:54:37,059 INFO L267 ElimStorePlain]: Start of recursive call 64: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-28 12:54:37,108 INFO L267 ElimStorePlain]: Start of recursive call 58: 6 dim-1 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-03-28 12:54:37,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 125 [2018-03-28 12:54:37,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 68 [2018-03-28 12:54:37,358 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:37,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2018-03-28 12:54:37,398 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:37,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 97 [2018-03-28 12:54:37,436 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:37,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 48 [2018-03-28 12:54:37,470 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:37,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 144 [2018-03-28 12:54:37,517 INFO L267 ElimStorePlain]: Start of recursive call 70: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-28 12:54:37,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 146 [2018-03-28 12:54:37,593 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-28 12:54:37,669 INFO L267 ElimStorePlain]: Start of recursive call 65: 6 dim-1 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-03-28 12:54:37,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 114 [2018-03-28 12:54:38,012 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:38,014 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:38,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 153 [2018-03-28 12:54:38,024 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-28 12:54:38,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 91 [2018-03-28 12:54:38,082 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:38,124 INFO L267 ElimStorePlain]: Start of recursive call 72: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-03-28 12:54:38,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 119 [2018-03-28 12:54:38,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-03-28 12:54:38,426 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:38,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 5 [2018-03-28 12:54:38,435 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:38,441 INFO L267 ElimStorePlain]: Start of recursive call 75: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:38,727 INFO L267 ElimStorePlain]: Start of recursive call 34: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: 28 dim-0 vars, and 29 xjuncts. [2018-03-28 12:54:38,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 90 [2018-03-28 12:54:38,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2018-03-28 12:54:38,746 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:38,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 76 [2018-03-28 12:54:38,780 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:38,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-03-28 12:54:38,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2018-03-28 12:54:38,816 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:38,821 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:38,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 74 [2018-03-28 12:54:38,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2018-03-28 12:54:38,856 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:38,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2018-03-28 12:54:38,877 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:38,889 INFO L267 ElimStorePlain]: Start of recursive call 83: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:38,902 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 38 dim-0 vars, and 39 xjuncts. [2018-03-28 12:54:39,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 77 [2018-03-28 12:54:39,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:39,771 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-03-28 12:54:39,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-03-28 12:54:39,782 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,783 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,786 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-03-28 12:54:39,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:39,807 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-03-28 12:54:39,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-03-28 12:54:39,816 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,817 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,822 INFO L267 ElimStorePlain]: Start of recursive call 90: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-03-28 12:54:39,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:39,841 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-03-28 12:54:39,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-03-28 12:54:39,848 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,849 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,853 INFO L267 ElimStorePlain]: Start of recursive call 94: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 75 [2018-03-28 12:54:39,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:39,884 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-03-28 12:54:39,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-03-28 12:54:39,894 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,896 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,899 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 75 [2018-03-28 12:54:39,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:39,932 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-03-28 12:54:39,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-03-28 12:54:39,944 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,945 INFO L267 ElimStorePlain]: Start of recursive call 104: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,949 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:39,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 72 [2018-03-28 12:54:40,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,009 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-03-28 12:54:40,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-03-28 12:54:40,039 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,041 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-03-28 12:54:40,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:54:40,044 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,048 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,063 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:54:40,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 75 [2018-03-28 12:54:40,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,095 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-03-28 12:54:40,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-03-28 12:54:40,106 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,108 INFO L267 ElimStorePlain]: Start of recursive call 114: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,111 INFO L267 ElimStorePlain]: Start of recursive call 112: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 65 [2018-03-28 12:54:40,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,147 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-03-28 12:54:40,157 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:40,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-03-28 12:54:40,158 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,160 INFO L267 ElimStorePlain]: Start of recursive call 118: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,163 INFO L267 ElimStorePlain]: Start of recursive call 116: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 77 [2018-03-28 12:54:40,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,196 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-03-28 12:54:40,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-03-28 12:54:40,207 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,208 INFO L267 ElimStorePlain]: Start of recursive call 122: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,212 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 62 [2018-03-28 12:54:40,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,241 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:40,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-03-28 12:54:40,252 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,253 INFO L267 ElimStorePlain]: Start of recursive call 126: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,258 INFO L267 ElimStorePlain]: Start of recursive call 124: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 77 [2018-03-28 12:54:40,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,290 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-03-28 12:54:40,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-03-28 12:54:40,302 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,303 INFO L267 ElimStorePlain]: Start of recursive call 130: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,307 INFO L267 ElimStorePlain]: Start of recursive call 128: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-03-28 12:54:40,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,324 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-03-28 12:54:40,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-03-28 12:54:40,331 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,332 INFO L267 ElimStorePlain]: Start of recursive call 134: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,336 INFO L267 ElimStorePlain]: Start of recursive call 132: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 56 [2018-03-28 12:54:40,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,363 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:40,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-03-28 12:54:40,372 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,373 INFO L267 ElimStorePlain]: Start of recursive call 138: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,376 INFO L267 ElimStorePlain]: Start of recursive call 136: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-03-28 12:54:40,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,394 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-03-28 12:54:40,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-03-28 12:54:40,402 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,403 INFO L267 ElimStorePlain]: Start of recursive call 142: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,407 INFO L267 ElimStorePlain]: Start of recursive call 140: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 58 [2018-03-28 12:54:40,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,435 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:40,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-03-28 12:54:40,445 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,446 INFO L267 ElimStorePlain]: Start of recursive call 146: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,449 INFO L267 ElimStorePlain]: Start of recursive call 144: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 57 [2018-03-28 12:54:40,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,498 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-03-28 12:54:40,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:54:40,522 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,525 INFO L267 ElimStorePlain]: Start of recursive call 150: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:40,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-03-28 12:54:40,542 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,543 INFO L267 ElimStorePlain]: Start of recursive call 152: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,555 INFO L267 ElimStorePlain]: Start of recursive call 148: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-03-28 12:54:40,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-03-28 12:54:40,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,573 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-03-28 12:54:40,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-03-28 12:54:40,581 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,582 INFO L267 ElimStorePlain]: Start of recursive call 156: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,585 INFO L267 ElimStorePlain]: Start of recursive call 154: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 58 [2018-03-28 12:54:40,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,613 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:40,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-03-28 12:54:40,622 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,624 INFO L267 ElimStorePlain]: Start of recursive call 160: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,629 INFO L267 ElimStorePlain]: Start of recursive call 158: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 75 [2018-03-28 12:54:40,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,666 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-03-28 12:54:40,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-03-28 12:54:40,678 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,679 INFO L267 ElimStorePlain]: Start of recursive call 164: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,684 INFO L267 ElimStorePlain]: Start of recursive call 162: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-03-28 12:54:40,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,706 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-03-28 12:54:40,715 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:40,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-03-28 12:54:40,716 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,717 INFO L267 ElimStorePlain]: Start of recursive call 168: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,721 INFO L267 ElimStorePlain]: Start of recursive call 166: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 56 [2018-03-28 12:54:40,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,747 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:40,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-03-28 12:54:40,757 INFO L267 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,758 INFO L267 ElimStorePlain]: Start of recursive call 172: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,762 INFO L267 ElimStorePlain]: Start of recursive call 170: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 58 [2018-03-28 12:54:40,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,790 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:40,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-03-28 12:54:40,800 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,801 INFO L267 ElimStorePlain]: Start of recursive call 176: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,806 INFO L267 ElimStorePlain]: Start of recursive call 174: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 56 [2018-03-28 12:54:40,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,835 INFO L267 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:40,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-03-28 12:54:40,844 INFO L267 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,845 INFO L267 ElimStorePlain]: Start of recursive call 180: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,848 INFO L267 ElimStorePlain]: Start of recursive call 178: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-03-28 12:54:40,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,867 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-03-28 12:54:40,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-03-28 12:54:40,874 INFO L267 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,876 INFO L267 ElimStorePlain]: Start of recursive call 184: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,879 INFO L267 ElimStorePlain]: Start of recursive call 182: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 56 [2018-03-28 12:54:40,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,906 INFO L267 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:40,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-03-28 12:54:40,915 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,916 INFO L267 ElimStorePlain]: Start of recursive call 188: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,920 INFO L267 ElimStorePlain]: Start of recursive call 186: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 75 [2018-03-28 12:54:40,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,951 INFO L267 ElimStorePlain]: Start of recursive call 191: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-03-28 12:54:40,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-03-28 12:54:40,962 INFO L267 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,963 INFO L267 ElimStorePlain]: Start of recursive call 192: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,967 INFO L267 ElimStorePlain]: Start of recursive call 190: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:40,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 56 [2018-03-28 12:54:40,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:40,993 INFO L267 ElimStorePlain]: Start of recursive call 195: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:41,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-03-28 12:54:41,002 INFO L267 ElimStorePlain]: Start of recursive call 197: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,003 INFO L267 ElimStorePlain]: Start of recursive call 196: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,007 INFO L267 ElimStorePlain]: Start of recursive call 194: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 53 [2018-03-28 12:54:41,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:41,041 INFO L267 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-03-28 12:54:41,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:54:41,070 INFO L267 ElimStorePlain]: Start of recursive call 201: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,073 INFO L267 ElimStorePlain]: Start of recursive call 200: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:41,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-03-28 12:54:41,078 INFO L267 ElimStorePlain]: Start of recursive call 203: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,080 INFO L267 ElimStorePlain]: Start of recursive call 202: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,098 INFO L267 ElimStorePlain]: Start of recursive call 198: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-28 12:54:41,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-03-28 12:54:41,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:41,124 INFO L267 ElimStorePlain]: Start of recursive call 205: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-03-28 12:54:41,135 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:41,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-03-28 12:54:41,136 INFO L267 ElimStorePlain]: Start of recursive call 207: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,138 INFO L267 ElimStorePlain]: Start of recursive call 206: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,142 INFO L267 ElimStorePlain]: Start of recursive call 204: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 76 [2018-03-28 12:54:41,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:41,209 INFO L267 ElimStorePlain]: Start of recursive call 209: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-03-28 12:54:41,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-03-28 12:54:41,245 INFO L267 ElimStorePlain]: Start of recursive call 211: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,248 INFO L267 ElimStorePlain]: Start of recursive call 210: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-03-28 12:54:41,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-03-28 12:54:41,253 INFO L267 ElimStorePlain]: Start of recursive call 213: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,255 INFO L267 ElimStorePlain]: Start of recursive call 212: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,268 INFO L267 ElimStorePlain]: Start of recursive call 208: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-03-28 12:54:41,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 81 [2018-03-28 12:54:41,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:41,309 INFO L267 ElimStorePlain]: Start of recursive call 215: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-03-28 12:54:41,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-03-28 12:54:41,325 INFO L267 ElimStorePlain]: Start of recursive call 217: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,326 INFO L267 ElimStorePlain]: Start of recursive call 216: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,332 INFO L267 ElimStorePlain]: Start of recursive call 214: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 56 [2018-03-28 12:54:41,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:41,362 INFO L267 ElimStorePlain]: Start of recursive call 219: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:41,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-03-28 12:54:41,373 INFO L267 ElimStorePlain]: Start of recursive call 221: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,375 INFO L267 ElimStorePlain]: Start of recursive call 220: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,380 INFO L267 ElimStorePlain]: Start of recursive call 218: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-03-28 12:54:41,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:41,400 INFO L267 ElimStorePlain]: Start of recursive call 223: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-03-28 12:54:41,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-03-28 12:54:41,410 INFO L267 ElimStorePlain]: Start of recursive call 225: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,411 INFO L267 ElimStorePlain]: Start of recursive call 224: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,416 INFO L267 ElimStorePlain]: Start of recursive call 222: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 65 [2018-03-28 12:54:41,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:41,448 INFO L267 ElimStorePlain]: Start of recursive call 227: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-03-28 12:54:41,461 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:41,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-03-28 12:54:41,462 INFO L267 ElimStorePlain]: Start of recursive call 229: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,463 INFO L267 ElimStorePlain]: Start of recursive call 228: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,467 INFO L267 ElimStorePlain]: Start of recursive call 226: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:41,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 44 dim-0 vars, and 45 xjuncts. [2018-03-28 12:54:41,810 INFO L202 ElimStorePlain]: Needed 229 recursive calls to eliminate 5 variables, input treesize:112, output treesize:638 [2018-03-28 12:54:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:42,071 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:42,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 14] imperfect sequences [] total 25 [2018-03-28 12:54:42,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-03-28 12:54:42,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-03-28 12:54:42,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=561, Unknown=2, NotChecked=0, Total=650 [2018-03-28 12:54:42,072 INFO L87 Difference]: Start difference. First operand 701 states and 826 transitions. Second operand 26 states. [2018-03-28 12:54:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:43,911 INFO L93 Difference]: Finished difference Result 1201 states and 1389 transitions. [2018-03-28 12:54:43,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-03-28 12:54:43,912 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 58 [2018-03-28 12:54:43,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:43,913 INFO L225 Difference]: With dead ends: 1201 [2018-03-28 12:54:43,914 INFO L226 Difference]: Without dead ends: 1200 [2018-03-28 12:54:43,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=374, Invalid=1694, Unknown=2, NotChecked=0, Total=2070 [2018-03-28 12:54:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2018-03-28 12:54:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 711. [2018-03-28 12:54:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2018-03-28 12:54:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 837 transitions. [2018-03-28 12:54:43,947 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 837 transitions. Word has length 58 [2018-03-28 12:54:43,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:43,947 INFO L459 AbstractCegarLoop]: Abstraction has 711 states and 837 transitions. [2018-03-28 12:54:43,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-03-28 12:54:43,948 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 837 transitions. [2018-03-28 12:54:43,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-03-28 12:54:43,948 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:43,948 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:43,948 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:43,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1079880201, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:43,956 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:43,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:43,992 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:43,993 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:43,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:54:43,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:43,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:43,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-28 12:54:44,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:44,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:44,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:44,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:44,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 12:54:44,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 12:54:44,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:44,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:44,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:44,024 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:14 [2018-03-28 12:54:44,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 75 [2018-03-28 12:54:44,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-03-28 12:54:44,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:44,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:44,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2018-03-28 12:54:44,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-03-28 12:54:44,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:44,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:44,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:44,094 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:84, output treesize:64 [2018-03-28 12:54:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:44,223 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:46,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 135 [2018-03-28 12:54:46,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:46,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:46,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 116 [2018-03-28 12:54:46,852 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:46,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2018-03-28 12:54:46,855 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:46,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:46,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-03-28 12:54:46,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 71 [2018-03-28 12:54:46,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:46,945 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:46,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2018-03-28 12:54:46,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 14 [2018-03-28 12:54:46,963 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:46,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2018-03-28 12:54:46,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-03-28 12:54:46,977 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:46,991 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:46,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2018-03-28 12:54:46,995 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:46,999 INFO L267 ElimStorePlain]: Start of recursive call 10: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,000 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 68 [2018-03-28 12:54:47,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2018-03-28 12:54:47,018 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 66 [2018-03-28 12:54:47,044 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 55 [2018-03-28 12:54:47,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2018-03-28 12:54:47,079 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:47,112 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,113 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,113 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 38 [2018-03-28 12:54:47,119 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-03-28 12:54:47,138 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,154 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,155 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-03-28 12:54:47,155 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:47,172 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 33 [2018-03-28 12:54:47,177 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,187 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-03-28 12:54:47,188 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,192 INFO L267 ElimStorePlain]: Start of recursive call 16: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,194 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,198 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 73 [2018-03-28 12:54:47,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:47,250 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2018-03-28 12:54:47,280 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 57 [2018-03-28 12:54:47,283 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2018-03-28 12:54:47,309 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 48 [2018-03-28 12:54:47,346 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,347 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 41 [2018-03-28 12:54:47,352 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,364 INFO L267 ElimStorePlain]: Start of recursive call 28: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,370 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 47 treesize of output 78 [2018-03-28 12:54:47,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2018-03-28 12:54:47,400 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,494 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 87 [2018-03-28 12:54:47,498 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2018-03-28 12:54:47,596 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 69 [2018-03-28 12:54:47,688 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-03-28 12:54:47,778 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,778 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 38 [2018-03-28 12:54:47,784 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,788 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 55 [2018-03-28 12:54:47,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-03-28 12:54:47,879 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-03-28 12:54:47,909 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-03-28 12:54:47,936 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,961 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,962 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:47,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 41 [2018-03-28 12:54:47,967 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:47,976 INFO L267 ElimStorePlain]: Start of recursive call 37: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 44 [2018-03-28 12:54:48,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2018-03-28 12:54:48,025 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,035 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:48,036 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:48,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 38 [2018-03-28 12:54:48,041 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,042 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,047 INFO L267 ElimStorePlain]: Start of recursive call 30: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,051 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 95 [2018-03-28 12:54:48,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-28 12:54:48,125 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 109 treesize of output 146 [2018-03-28 12:54:48,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 116 [2018-03-28 12:54:48,173 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 121 [2018-03-28 12:54:48,294 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,409 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:48,409 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:48,410 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:48,411 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:48,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 233 [2018-03-28 12:54:48,412 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,537 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:48,537 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:48,538 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:48,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 143 [2018-03-28 12:54:48,539 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 121 [2018-03-28 12:54:48,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 99 [2018-03-28 12:54:48,665 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-03-28 12:54:48,683 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,701 INFO L267 ElimStorePlain]: Start of recursive call 52: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2018-03-28 12:54:48,857 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:48,858 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:48,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 131 [2018-03-28 12:54:48,860 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,872 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:48,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 127 [2018-03-28 12:54:48,956 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:48,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 151 [2018-03-28 12:54:48,971 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 3 xjuncts. [2018-03-28 12:54:49,080 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:49,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 144 [2018-03-28 12:54:49,097 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 3 xjuncts. [2018-03-28 12:54:49,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 109 [2018-03-28 12:54:49,276 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-03-28 12:54:49,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2018-03-28 12:54:49,330 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:49,416 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:49,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 97 [2018-03-28 12:54:49,422 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-03-28 12:54:49,439 INFO L267 ElimStorePlain]: Start of recursive call 57: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:49,455 INFO L267 ElimStorePlain]: Start of recursive call 47: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:49,460 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:49,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 108 [2018-03-28 12:54:49,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2018-03-28 12:54:49,481 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:49,512 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:49,512 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:49,514 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:54:49,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 106 [2018-03-28 12:54:49,514 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:49,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 90 [2018-03-28 12:54:49,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-03-28 12:54:49,563 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:49,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-03-28 12:54:49,586 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:49,619 INFO L267 ElimStorePlain]: Start of recursive call 66: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:54:49,642 INFO L267 ElimStorePlain]: Start of recursive call 63: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:54:49,653 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:54:49,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-28 12:54:49,701 INFO L202 ElimStorePlain]: Needed 68 recursive calls to eliminate 8 variables, input treesize:289, output treesize:18 [2018-03-28 12:54:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:49,761 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:49,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 14] imperfect sequences [] total 25 [2018-03-28 12:54:49,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-03-28 12:54:49,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-03-28 12:54:49,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=498, Unknown=1, NotChecked=0, Total=600 [2018-03-28 12:54:49,762 INFO L87 Difference]: Start difference. First operand 711 states and 837 transitions. Second operand 25 states. [2018-03-28 12:54:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:51,061 INFO L93 Difference]: Finished difference Result 1064 states and 1214 transitions. [2018-03-28 12:54:51,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-03-28 12:54:51,061 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2018-03-28 12:54:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:51,062 INFO L225 Difference]: With dead ends: 1064 [2018-03-28 12:54:51,063 INFO L226 Difference]: Without dead ends: 941 [2018-03-28 12:54:51,064 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=402, Invalid=1577, Unknown=1, NotChecked=0, Total=1980 [2018-03-28 12:54:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2018-03-28 12:54:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 701. [2018-03-28 12:54:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-03-28 12:54:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 825 transitions. [2018-03-28 12:54:51,101 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 825 transitions. Word has length 58 [2018-03-28 12:54:51,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:51,101 INFO L459 AbstractCegarLoop]: Abstraction has 701 states and 825 transitions. [2018-03-28 12:54:51,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-03-28 12:54:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 825 transitions. [2018-03-28 12:54:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-03-28 12:54:51,102 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:51,102 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 12:54:51,102 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:51,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1416821826, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:51,111 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:51,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:51,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 12:54:51,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 12:54:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:51,150 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:51,186 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 12:54:51,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-28 12:54:51,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 12:54:51,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 12:54:51,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-28 12:54:51,186 INFO L87 Difference]: Start difference. First operand 701 states and 825 transitions. Second operand 6 states. [2018-03-28 12:54:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 12:54:51,475 INFO L93 Difference]: Finished difference Result 1348 states and 1593 transitions. [2018-03-28 12:54:51,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-28 12:54:51,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-03-28 12:54:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 12:54:51,477 INFO L225 Difference]: With dead ends: 1348 [2018-03-28 12:54:51,477 INFO L226 Difference]: Without dead ends: 1346 [2018-03-28 12:54:51,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-03-28 12:54:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2018-03-28 12:54:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 699. [2018-03-28 12:54:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-03-28 12:54:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 823 transitions. [2018-03-28 12:54:51,500 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 823 transitions. Word has length 59 [2018-03-28 12:54:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 12:54:51,500 INFO L459 AbstractCegarLoop]: Abstraction has 699 states and 823 transitions. [2018-03-28 12:54:51,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 12:54:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 823 transitions. [2018-03-28 12:54:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-03-28 12:54:51,501 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 12:54:51,501 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-03-28 12:54:51,501 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 12:54:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash 335554922, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 12:54:51,508 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 12:54:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 12:54:51,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 12:54:51,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-28 12:54:51,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:54:51,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-28 12:54:51,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:54:51,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,630 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-03-28 12:54:51,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-03-28 12:54:51,641 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:51,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-03-28 12:54:51,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-03-28 12:54:51,659 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:51,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-03-28 12:54:51,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,670 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-03-28 12:54:51,681 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:51,682 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:51,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:54:51,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:37 [2018-03-28 12:54:51,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-03-28 12:54:51,706 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:51,707 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:51,708 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:51,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-03-28 12:54:51,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-03-28 12:54:51,737 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:51,738 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:51,739 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:51,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-03-28 12:54:51,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,790 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:68, output treesize:48 [2018-03-28 12:54:51,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-03-28 12:54:51,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:54:51,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-03-28 12:54:51,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:54:51,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,945 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:94, output treesize:48 [2018-03-28 12:54:51,948 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:51,949 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:51,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 12:54:51,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:47 [2018-03-28 12:54:51,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-03-28 12:54:51,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:54:51,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:51,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-03-28 12:54:52,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 12:54:52,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:47 [2018-03-28 12:54:52,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-03-28 12:54:52,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:54:52,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-03-28 12:54:52,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-03-28 12:54:52,078 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 12:54:52,093 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:57 [2018-03-28 12:54:52,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-03-28 12:54:52,139 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:52,140 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:52,140 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:52,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-03-28 12:54:52,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-03-28 12:54:52,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-03-28 12:54:52,155 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 12:54:52,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-03-28 12:54:52,156 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,158 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 12:54:52,160 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:71, output treesize:7 [2018-03-28 12:54:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:54:52,193 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 12:54:52,614 WARN L148 SmtUtils]: Spent 141ms on a formula simplification that was a NOOP. DAG size: 42 [2018-03-28 12:54:55,555 WARN L148 SmtUtils]: Spent 675ms on a formula simplification that was a NOOP. DAG size: 67 [2018-03-28 12:55:02,526 WARN L148 SmtUtils]: Spent 608ms on a formula simplification that was a NOOP. DAG size: 68 [2018-03-28 12:55:02,532 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:55:02,532 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:55:02,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 287 [2018-03-28 12:55:02,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 12:55:02,572 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:55:02,572 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 12:55:02,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 287 [2018-03-28 12:55:02,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 12:55:02,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 2 dim-1 vars, End of recursive call: 15 dim-0 vars, and 2 xjuncts. [2018-03-28 12:55:02,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 17 variables, input treesize:593, output treesize:575 [2018-03-28 12:55:09,373 WARN L148 SmtUtils]: Spent 178ms on a formula simplification that was a NOOP. DAG size: 69 [2018-03-28 12:55:16,352 WARN L148 SmtUtils]: Spent 167ms on a formula simplification that was a NOOP. DAG size: 80 [2018-03-28 12:55:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 12:55:27,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 12:55:27,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 26 [2018-03-28 12:55:27,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-03-28 12:55:27,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-03-28 12:55:27,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=539, Unknown=14, NotChecked=0, Total=650 [2018-03-28 12:55:27,576 INFO L87 Difference]: Start difference. First operand 699 states and 823 transitions. Second operand 26 states. Received shutdown request... [2018-03-28 12:55:42,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-03-28 12:55:42,599 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-28 12:55:42,605 WARN L197 ceAbstractionStarter]: Timeout [2018-03-28 12:55:42,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:55:42 BoogieIcfgContainer [2018-03-28 12:55:42,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-28 12:55:42,606 INFO L168 Benchmark]: Toolchain (without parser) took 141687.72 ms. Allocated memory was 303.6 MB in the beginning and 621.8 MB in the end (delta: 318.2 MB). Free memory was 240.9 MB in the beginning and 530.3 MB in the end (delta: -289.4 MB). Peak memory consumption was 28.8 MB. Max. memory is 5.3 GB. [2018-03-28 12:55:42,607 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 303.6 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-28 12:55:42,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.42 ms. Allocated memory is still 303.6 MB. Free memory was 240.9 MB in the beginning and 214.9 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-03-28 12:55:42,608 INFO L168 Benchmark]: Boogie Preprocessor took 65.48 ms. Allocated memory is still 303.6 MB. Free memory was 214.9 MB in the beginning and 211.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-03-28 12:55:42,608 INFO L168 Benchmark]: RCFGBuilder took 880.38 ms. Allocated memory was 303.6 MB in the beginning and 467.1 MB in the end (delta: 163.6 MB). Free memory was 211.9 MB in the beginning and 364.8 MB in the end (delta: -152.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. [2018-03-28 12:55:42,608 INFO L168 Benchmark]: TraceAbstraction took 140393.76 ms. Allocated memory was 467.1 MB in the beginning and 621.8 MB in the end (delta: 154.7 MB). Free memory was 363.4 MB in the beginning and 530.3 MB in the end (delta: -166.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-03-28 12:55:42,610 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 303.6 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 341.42 ms. Allocated memory is still 303.6 MB. Free memory was 240.9 MB in the beginning and 214.9 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 65.48 ms. Allocated memory is still 303.6 MB. Free memory was 214.9 MB in the beginning and 211.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 880.38 ms. Allocated memory was 303.6 MB in the beginning and 467.1 MB in the end (delta: 163.6 MB). Free memory was 211.9 MB in the beginning and 364.8 MB in the end (delta: -152.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 140393.76 ms. Allocated memory was 467.1 MB in the beginning and 621.8 MB in the end (delta: 154.7 MB). Free memory was 363.4 MB in the beginning and 530.3 MB in the end (delta: -166.9 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 698]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 694]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 709]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 703]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 723]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 723]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 703]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 705]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 698]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 709]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 694]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 705]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (699states) and interpolant automaton (currently 24 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (1322 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 292 locations, 101 error locations. TIMEOUT Result, 140.3s OverallTime, 43 OverallIterations, 2 TraceHistogramMax, 43.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11708 SDtfs, 39285 SDslu, 48623 SDs, 0 SdLazy, 27489 SolverSat, 1595 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 31.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3887 GetRequests, 3236 SyntacticMatches, 24 SemanticMatches, 627 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3129 ImplicationChecksByTransitivity, 81.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=751occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 42 MinimizatonAttempts, 14852 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 93.3s InterpolantComputationTime, 1828 NumberOfCodeBlocks, 1828 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3570 ConstructedInterpolants, 411 QuantifiedInterpolants, 1991605 SizeOfPredicates, 437 NumberOfNonLiveVariables, 6368 ConjunctsInSsa, 580 ConjunctsInUnsatCore, 86 InterpolantComputations, 82 PerfectInterpolantSequences, 24/46 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-28_12-55-42-622.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-28_12-55-42-622.csv Completed graceful shutdown