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/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8168ed2-m [2018-04-12 00:06:28,348 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 00:06:28,350 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 00:06:28,363 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 00:06:28,363 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 00:06:28,364 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 00:06:28,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 00:06:28,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 00:06:28,369 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 00:06:28,370 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 00:06:28,371 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 00:06:28,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 00:06:28,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 00:06:28,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 00:06:28,374 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 00:06:28,376 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 00:06:28,378 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 00:06:28,380 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 00:06:28,381 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 00:06:28,383 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 00:06:28,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 00:06:28,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 00:06:28,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 00:06:28,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 00:06:28,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 00:06:28,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 00:06:28,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 00:06:28,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 00:06:28,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 00:06:28,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 00:06:28,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 00:06:28,392 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-04-12 00:06:28,416 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 00:06:28,416 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 00:06:28,417 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-12 00:06:28,417 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-12 00:06:28,417 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-12 00:06:28,418 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-12 00:06:28,418 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-12 00:06:28,418 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-12 00:06:28,418 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-12 00:06:28,418 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-12 00:06:28,419 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-12 00:06:28,419 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-12 00:06:28,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 00:06:28,419 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 00:06:28,420 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 00:06:28,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 00:06:28,420 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 00:06:28,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 00:06:28,420 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 00:06:28,420 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-12 00:06:28,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 00:06:28,421 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 00:06:28,421 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 00:06:28,421 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-12 00:06:28,421 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-12 00:06:28,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 00:06:28,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 00:06:28,422 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 00:06:28,422 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 00:06:28,422 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 00:06:28,422 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-12 00:06:28,422 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-12 00:06:28,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-12 00:06:28,423 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-12 00:06:28,423 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-12 00:06:28,424 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-12 00:06:28,424 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-12 00:06:28,424 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-12 00:06:28,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 00:06:28,468 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 00:06:28,472 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 00:06:28,473 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 00:06:28,474 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 00:06:28,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:28,819 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG37b638aa2 [2018-04-12 00:06:28,990 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 00:06:28,990 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 00:06:28,991 INFO L168 CDTParser]: Scanning sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,002 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 00:06:29,003 INFO L215 ultiparseSymbolTable]: [2018-04-12 00:06:29,003 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 00:06:29,003 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,003 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 00:06:29,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_key_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____dev_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__blksize_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____u_char in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____blksize_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____qaddr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__int16_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__lldiv_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____off64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____rlim64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__div_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____id_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____uint32_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_char in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____suseconds_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__time_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__blkcnt_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_quad_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__uid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____rlim_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__int8_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____intptr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____mode_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____ino_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____time_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____socklen_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__daddr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fsid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_int64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____loff_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__int64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__size_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____int16_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____uint16_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____u_long in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____clock_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____int8_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__mode_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__ulong in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__SLL in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_short in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__fsid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__caddr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____sigset_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__gid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____u_short in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__clock_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__suseconds_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_long in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____caddr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,009 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__fd_set in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,009 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____int64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,009 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,009 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____uid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,009 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__nlink_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,009 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,009 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__uint in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,009 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fd_mask in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,009 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__id_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,010 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,010 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_int8_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,010 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_once_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,010 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__dev_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,010 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_int16_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,010 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__register_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,010 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____daddr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,010 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____key_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,010 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,011 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____uint8_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,011 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__off_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,011 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____u_int in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,011 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,011 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__quad_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,011 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____clockid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,011 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____useconds_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,011 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,011 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__loff_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,011 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__ldiv_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,012 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__ushort in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,012 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__wchar_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,012 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____u_quad_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,012 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,012 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__ino_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,012 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,012 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____ino64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,012 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____gid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,012 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__idtype_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,013 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____pid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,013 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____ssize_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,013 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,013 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____quad_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,013 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,013 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____blkcnt_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,013 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____timer_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,013 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_int in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,013 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____int32_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,014 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____nlink_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,014 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__sigset_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,014 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__timer_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,014 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,014 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__u_int32_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,014 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__clockid_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,014 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____fsword_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,014 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__ssize_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,014 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__fd_mask in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,015 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,015 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__key_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,015 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,015 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__int32_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,015 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,015 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____uint64_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,015 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_circular_true_unreach_call_true_valid_memsafety_i____off_t in sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:29,034 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG37b638aa2 [2018-04-12 00:06:29,039 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 00:06:29,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 00:06:29,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 00:06:29,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 00:06:29,047 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 00:06:29,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 12:06:29" (1/1) ... [2018-04-12 00:06:29,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66865057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:06:29, skipping insertion in model container [2018-04-12 00:06:29,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 12:06:29" (1/1) ... [2018-04-12 00:06:29,065 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 00:06:29,097 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 00:06:29,271 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 00:06:29,327 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 00:06:29,335 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-12 00:06:29,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:06:29 WrapperNode [2018-04-12 00:06:29,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 00:06:29,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 00:06:29,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 00:06:29,387 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 00:06:29,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:06:29" (1/1) ... [2018-04-12 00:06:29,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:06:29" (1/1) ... [2018-04-12 00:06:29,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:06:29" (1/1) ... [2018-04-12 00:06:29,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:06:29" (1/1) ... [2018-04-12 00:06:29,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:06:29" (1/1) ... [2018-04-12 00:06:29,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:06:29" (1/1) ... [2018-04-12 00:06:29,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:06:29" (1/1) ... [2018-04-12 00:06:29,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 00:06:29,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 00:06:29,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 00:06:29,448 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 00:06:29,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:06:29" (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-04-12 00:06:29,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 00:06:29,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 00:06:29,571 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 00:06:29,571 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 00:06:29,571 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 00:06:29,571 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 00:06:29,571 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 00:06:29,571 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 00:06:29,571 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 00:06:29,572 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 00:06:29,572 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 00:06:29,572 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 00:06:29,572 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 00:06:29,572 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 00:06:29,572 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 00:06:29,572 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 00:06:29,573 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 00:06:29,573 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 00:06:29,573 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 00:06:29,573 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 00:06:29,573 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 00:06:29,573 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 00:06:29,573 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 00:06:29,574 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 00:06:29,574 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 00:06:29,574 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 00:06:29,574 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 00:06:29,574 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 00:06:29,574 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 00:06:29,574 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 00:06:29,575 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 00:06:29,575 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 00:06:29,575 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 00:06:29,575 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 00:06:29,575 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 00:06:29,575 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 00:06:29,575 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 00:06:29,576 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 00:06:29,576 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 00:06:29,576 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 00:06:29,576 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 00:06:29,576 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 00:06:29,576 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 00:06:29,576 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 00:06:29,576 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 00:06:29,577 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 00:06:29,577 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 00:06:29,577 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 00:06:29,577 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 00:06:29,577 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 00:06:29,577 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 00:06:29,577 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 00:06:29,578 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 00:06:29,578 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 00:06:29,578 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 00:06:29,578 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 00:06:29,578 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 00:06:29,578 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 00:06:29,578 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 00:06:29,578 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 00:06:29,579 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 00:06:29,579 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-12 00:06:29,579 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 00:06:29,579 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 00:06:29,579 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-12 00:06:29,579 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 00:06:29,579 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 00:06:29,579 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-12 00:06:29,580 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 00:06:29,580 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 00:06:29,580 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 00:06:29,580 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 00:06:29,580 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 00:06:29,580 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 00:06:29,580 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 00:06:29,581 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 00:06:29,581 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 00:06:29,581 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 00:06:29,581 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 00:06:29,581 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 00:06:29,581 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 00:06:29,581 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 00:06:29,581 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 00:06:29,582 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 00:06:29,582 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 00:06:29,582 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 00:06:29,582 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 00:06:29,582 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 00:06:29,582 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 00:06:29,582 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 00:06:29,582 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 00:06:29,583 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 00:06:29,583 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 00:06:29,583 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 00:06:29,583 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 00:06:29,583 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 00:06:29,583 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 00:06:29,583 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 00:06:29,584 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 00:06:29,584 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 00:06:29,584 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 00:06:29,584 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 00:06:29,584 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 00:06:29,584 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 00:06:29,584 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 00:06:29,584 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 00:06:29,585 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 00:06:29,585 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 00:06:29,585 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 00:06:29,585 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 00:06:29,585 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 00:06:29,585 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 00:06:29,585 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 00:06:29,586 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 00:06:29,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 00:06:29,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 00:06:29,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 00:06:29,586 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 00:06:30,136 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 00:06:30,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 12:06:30 BoogieIcfgContainer [2018-04-12 00:06:30,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 00:06:30,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 00:06:30,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 00:06:30,140 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 00:06:30,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 12:06:29" (1/3) ... [2018-04-12 00:06:30,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a678ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 12:06:30, skipping insertion in model container [2018-04-12 00:06:30,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 12:06:29" (2/3) ... [2018-04-12 00:06:30,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a678ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 12:06:30, skipping insertion in model container [2018-04-12 00:06:30,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 12:06:30" (3/3) ... [2018-04-12 00:06:30,144 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-circular_true-unreach-call_true-valid-memsafety.i [2018-04-12 00:06:30,151 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 00:06:30,158 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-04-12 00:06:30,199 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 00:06:30,199 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 00:06:30,199 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-12 00:06:30,199 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 00:06:30,200 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 00:06:30,200 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 00:06:30,200 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 00:06:30,200 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 00:06:30,200 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 00:06:30,201 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 00:06:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2018-04-12 00:06:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-12 00:06:30,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:30,223 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:06:30,223 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash 741261419, 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-04-12 00:06:30,243 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:30,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:30,311 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-04-12 00:06:30,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:30,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:30,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 00:06:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:30,332 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:30,359 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:30,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-12 00:06:30,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 00:06:30,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 00:06:30,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 00:06:30,373 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 4 states. [2018-04-12 00:06:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:30,597 INFO L93 Difference]: Finished difference Result 285 states and 325 transitions. [2018-04-12 00:06:30,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 00:06:30,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-04-12 00:06:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:30,612 INFO L225 Difference]: With dead ends: 285 [2018-04-12 00:06:30,612 INFO L226 Difference]: Without dead ends: 147 [2018-04-12 00:06:30,617 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-04-12 00:06:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-12 00:06:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2018-04-12 00:06:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-12 00:06:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-04-12 00:06:30,668 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 9 [2018-04-12 00:06:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:30,669 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-04-12 00:06:30,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 00:06:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-04-12 00:06:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-12 00:06:30,670 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:30,670 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:06:30,670 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:30,670 INFO L82 PathProgramCache]: Analyzing trace with hash 741261420, 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-04-12 00:06:30,680 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:30,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:30,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 6 treesize of output 5 [2018-04-12 00:06:30,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:30,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:30,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 00:06:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:30,730 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:30,803 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:30,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-12 00:06:30,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 00:06:30,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 00:06:30,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-12 00:06:30,805 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 6 states. [2018-04-12 00:06:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:30,914 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2018-04-12 00:06:30,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 00:06:30,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-04-12 00:06:30,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:30,916 INFO L225 Difference]: With dead ends: 140 [2018-04-12 00:06:30,917 INFO L226 Difference]: Without dead ends: 136 [2018-04-12 00:06:30,918 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 00:06:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-12 00:06:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2018-04-12 00:06:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-12 00:06:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2018-04-12 00:06:30,927 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 9 [2018-04-12 00:06:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:30,927 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2018-04-12 00:06:30,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 00:06:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2018-04-12 00:06:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 00:06:30,928 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:30,928 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:06:30,928 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:30,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1880541492, 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-04-12 00:06:30,936 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:30,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:30,975 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:31,003 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:31,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-12 00:06:31,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 00:06:31,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 00:06:31,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 00:06:31,005 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand 4 states. [2018-04-12 00:06:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:31,100 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2018-04-12 00:06:31,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 00:06:31,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-12 00:06:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:31,101 INFO L225 Difference]: With dead ends: 132 [2018-04-12 00:06:31,102 INFO L226 Difference]: Without dead ends: 121 [2018-04-12 00:06:31,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-04-12 00:06:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-12 00:06:31,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-04-12 00:06:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-12 00:06:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-04-12 00:06:31,112 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 17 [2018-04-12 00:06:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:31,112 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-04-12 00:06:31,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 00:06:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-04-12 00:06:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 00:06:31,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:31,113 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:06:31,113 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:31,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1880541493, 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-04-12 00:06:31,120 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:31,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:31,226 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:31,266 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:31,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-12 00:06:31,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 00:06:31,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 00:06:31,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 00:06:31,267 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 4 states. [2018-04-12 00:06:31,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:31,448 INFO L93 Difference]: Finished difference Result 176 states and 187 transitions. [2018-04-12 00:06:31,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 00:06:31,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-12 00:06:31,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:31,450 INFO L225 Difference]: With dead ends: 176 [2018-04-12 00:06:31,451 INFO L226 Difference]: Without dead ends: 174 [2018-04-12 00:06:31,451 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-04-12 00:06:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-04-12 00:06:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 109. [2018-04-12 00:06:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-12 00:06:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-04-12 00:06:31,462 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 17 [2018-04-12 00:06:31,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:31,463 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-04-12 00:06:31,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 00:06:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-04-12 00:06:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 00:06:31,464 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:31,464 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 00:06:31,464 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1832665467, 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-04-12 00:06:31,478 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:31,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:31,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:06:31,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:06:31,530 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-04-12 00:06:31,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:31,540 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-04-12 00:06:31,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:31,563 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-04-12 00:06:31,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-12 00:06:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:31,583 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:31,702 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:31,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-12 00:06:31,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 00:06:31,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 00:06:31,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-12 00:06:31,704 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 8 states. [2018-04-12 00:06:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:31,907 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-04-12 00:06:31,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:06:31,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-12 00:06:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:31,909 INFO L225 Difference]: With dead ends: 121 [2018-04-12 00:06:31,909 INFO L226 Difference]: Without dead ends: 117 [2018-04-12 00:06:31,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-04-12 00:06:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-12 00:06:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2018-04-12 00:06:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-12 00:06:31,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-04-12 00:06:31,919 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 18 [2018-04-12 00:06:31,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:31,919 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-04-12 00:06:31,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 00:06:31,919 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-04-12 00:06:31,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 00:06:31,920 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:31,920 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] [2018-04-12 00:06:31,920 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:31,920 INFO L82 PathProgramCache]: Analyzing trace with hash -168236984, 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-04-12 00:06:31,926 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:31,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:31,943 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-04-12 00:06:31,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:31,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:31,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 00:06:31,949 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-04-12 00:06:31,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, 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-04-12 00:06:31,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:31,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:31,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:31,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-12 00:06:31,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, 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 13 [2018-04-12 00:06:31,962 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 13 treesize of output 5 [2018-04-12 00:06:31,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:31,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:31,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:31,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-12 00:06:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:31,973 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:31,998 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:31,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-12 00:06:31,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 00:06:31,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 00:06:31,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 00:06:31,998 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 6 states. [2018-04-12 00:06:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:32,205 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2018-04-12 00:06:32,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 00:06:32,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-04-12 00:06:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:32,206 INFO L225 Difference]: With dead ends: 174 [2018-04-12 00:06:32,206 INFO L226 Difference]: Without dead ends: 173 [2018-04-12 00:06:32,207 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-12 00:06:32,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-12 00:06:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 104. [2018-04-12 00:06:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-12 00:06:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2018-04-12 00:06:32,213 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 22 [2018-04-12 00:06:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:32,214 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2018-04-12 00:06:32,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 00:06:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2018-04-12 00:06:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 00:06:32,214 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:32,215 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] [2018-04-12 00:06:32,215 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:32,215 INFO L82 PathProgramCache]: Analyzing trace with hash -168236983, 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-04-12 00:06:32,221 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:32,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:32,242 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-04-12 00:06:32,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 00:06:32,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 00:06:32,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, 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-04-12 00:06:32,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,284 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-04-12 00:06:32,286 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-04-12 00:06:32,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-12 00:06:32,299 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 17 treesize of output 13 [2018-04-12 00:06:32,301 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 13 treesize of output 5 [2018-04-12 00:06:32,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,314 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-04-12 00:06:32,316 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-04-12 00:06:32,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-04-12 00:06:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:32,332 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:32,387 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:32,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-12 00:06:32,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 00:06:32,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 00:06:32,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-12 00:06:32,388 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 10 states. [2018-04-12 00:06:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:32,683 INFO L93 Difference]: Finished difference Result 178 states and 187 transitions. [2018-04-12 00:06:32,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 00:06:32,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-12 00:06:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:32,684 INFO L225 Difference]: With dead ends: 178 [2018-04-12 00:06:32,684 INFO L226 Difference]: Without dead ends: 175 [2018-04-12 00:06:32,685 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-04-12 00:06:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-04-12 00:06:32,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 100. [2018-04-12 00:06:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-12 00:06:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-04-12 00:06:32,692 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 22 [2018-04-12 00:06:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:32,692 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-04-12 00:06:32,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 00:06:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-04-12 00:06:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 00:06:32,693 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:32,693 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] [2018-04-12 00:06:32,693 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:32,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1687488129, 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-04-12 00:06:32,703 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:32,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:32,721 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-04-12 00:06:32,723 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-04-12 00:06:32,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-12 00:06:32,734 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-04-12 00:06:32,735 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-04-12 00:06:32,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:32,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-04-12 00:06:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:32,746 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:32,774 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:32,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-12 00:06:32,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 00:06:32,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 00:06:32,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 00:06:32,775 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 6 states. [2018-04-12 00:06:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:33,050 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2018-04-12 00:06:33,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:06:33,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-12 00:06:33,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:33,052 INFO L225 Difference]: With dead ends: 165 [2018-04-12 00:06:33,052 INFO L226 Difference]: Without dead ends: 164 [2018-04-12 00:06:33,052 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 00:06:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-12 00:06:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 113. [2018-04-12 00:06:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-12 00:06:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2018-04-12 00:06:33,059 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 25 [2018-04-12 00:06:33,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:33,059 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2018-04-12 00:06:33,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 00:06:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2018-04-12 00:06:33,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 00:06:33,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:33,061 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] [2018-04-12 00:06:33,061 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:33,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1687488130, 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-04-12 00:06:33,083 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:33,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:33,135 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-04-12 00:06:33,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 8 treesize of output 7 [2018-04-12 00:06:33,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,146 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-04-12 00:06:33,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 8 treesize of output 7 [2018-04-12 00:06:33,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-12 00:06:33,176 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-04-12 00:06:33,178 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-04-12 00:06:33,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,187 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-04-12 00:06:33,189 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-04-12 00:06:33,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,195 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2018-04-12 00:06:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:33,212 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:33,254 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 18 treesize of output 16 [2018-04-12 00:06:33,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,269 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 24 treesize of output 28 [2018-04-12 00:06:33,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:33,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:06:33,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:26 [2018-04-12 00:06:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:33,315 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:33,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 11 [2018-04-12 00:06:33,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 00:06:33,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 00:06:33,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-12 00:06:33,316 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 12 states. [2018-04-12 00:06:33,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:33,667 INFO L93 Difference]: Finished difference Result 214 states and 225 transitions. [2018-04-12 00:06:33,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 00:06:33,668 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-04-12 00:06:33,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:33,669 INFO L225 Difference]: With dead ends: 214 [2018-04-12 00:06:33,669 INFO L226 Difference]: Without dead ends: 212 [2018-04-12 00:06:33,669 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2018-04-12 00:06:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-12 00:06:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 117. [2018-04-12 00:06:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-12 00:06:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-04-12 00:06:33,677 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 25 [2018-04-12 00:06:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:33,678 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-04-12 00:06:33,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 00:06:33,678 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-04-12 00:06:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 00:06:33,679 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:33,679 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-04-12 00:06:33,679 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:33,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1327051492, 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-04-12 00:06:33,690 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:33,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:33,726 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-04-12 00:06:33,728 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-04-12 00:06:33,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,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, 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-04-12 00:06:33,737 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-04-12 00:06:33,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,742 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-12 00:06:33,750 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-04-12 00:06:33,753 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-04-12 00:06:33,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,760 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-04-12 00:06:33,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:20 [2018-04-12 00:06:33,784 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 19 treesize of output 11 [2018-04-12 00:06:33,786 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-04-12 00:06:33,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:33,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:5 [2018-04-12 00:06:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:33,810 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:33,861 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:33,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-12 00:06:33,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 00:06:33,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 00:06:33,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-12 00:06:33,861 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 9 states. [2018-04-12 00:06:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:34,090 INFO L93 Difference]: Finished difference Result 191 states and 203 transitions. [2018-04-12 00:06:34,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 00:06:34,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-04-12 00:06:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:34,091 INFO L225 Difference]: With dead ends: 191 [2018-04-12 00:06:34,091 INFO L226 Difference]: Without dead ends: 190 [2018-04-12 00:06:34,092 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-04-12 00:06:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-04-12 00:06:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 118. [2018-04-12 00:06:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-12 00:06:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-12 00:06:34,101 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 30 [2018-04-12 00:06:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:34,102 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-12 00:06:34,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 00:06:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-12 00:06:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 00:06:34,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:34,103 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-04-12 00:06:34,103 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:34,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1327051493, 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-04-12 00:06:34,110 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:34,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:34,132 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-04-12 00:06:34,134 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-04-12 00:06:34,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,143 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-04-12 00:06:34,144 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-04-12 00:06:34,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,146 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,151 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-12 00:06:34,213 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 38 treesize of output 28 [2018-04-12 00:06:34,215 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 28 treesize of output 22 [2018-04-12 00:06:34,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,226 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 13 [2018-04-12 00:06:34,228 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 13 treesize of output 3 [2018-04-12 00:06:34,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:13 [2018-04-12 00:06:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:34,245 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:34,313 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 46 treesize of output 50 [2018-04-12 00:06:34,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:34,326 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 32 treesize of output 30 [2018-04-12 00:06:34,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:06:34,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:71 [2018-04-12 00:06:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:34,398 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:34,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2018-04-12 00:06:34,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 00:06:34,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 00:06:34,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-12 00:06:34,399 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 11 states. [2018-04-12 00:06:34,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:34,643 INFO L93 Difference]: Finished difference Result 193 states and 204 transitions. [2018-04-12 00:06:34,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 00:06:34,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-04-12 00:06:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:34,645 INFO L225 Difference]: With dead ends: 193 [2018-04-12 00:06:34,645 INFO L226 Difference]: Without dead ends: 192 [2018-04-12 00:06:34,646 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-04-12 00:06:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-04-12 00:06:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 118. [2018-04-12 00:06:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-12 00:06:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-04-12 00:06:34,656 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 30 [2018-04-12 00:06:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:34,656 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-04-12 00:06:34,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 00:06:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-04-12 00:06:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 00:06:34,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:34,657 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-04-12 00:06:34,657 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:34,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1294132703, 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-04-12 00:06:34,666 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:34,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:34,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, 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-04-12 00:06:34,687 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-04-12 00:06:34,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-12 00:06:34,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 15 treesize of output 11 [2018-04-12 00:06:34,705 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-04-12 00:06:34,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-04-12 00:06:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:34,716 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:34,744 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:34,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-12 00:06:34,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 00:06:34,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 00:06:34,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 00:06:34,745 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 6 states. [2018-04-12 00:06:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:34,870 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-04-12 00:06:34,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:06:34,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-12 00:06:34,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:34,871 INFO L225 Difference]: With dead ends: 168 [2018-04-12 00:06:34,871 INFO L226 Difference]: Without dead ends: 167 [2018-04-12 00:06:34,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 00:06:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-12 00:06:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 148. [2018-04-12 00:06:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-12 00:06:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2018-04-12 00:06:34,885 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 32 [2018-04-12 00:06:34,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:34,885 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2018-04-12 00:06:34,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 00:06:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2018-04-12 00:06:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 00:06:34,886 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:34,887 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-04-12 00:06:34,887 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:34,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1294132704, 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-04-12 00:06:34,893 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:34,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:34,914 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-04-12 00:06:34,915 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-04-12 00:06:34,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,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, 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-04-12 00:06:34,923 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-04-12 00:06:34,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,928 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-12 00:06:34,974 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-04-12 00:06:34,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 11 treesize of output 3 [2018-04-12 00:06:34,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,983 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-04-12 00:06:34,985 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-04-12 00:06:34,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:34,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2018-04-12 00:06:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:35,006 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:35,093 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 24 treesize of output 28 [2018-04-12 00:06:35,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:35,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:06:35,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:37 [2018-04-12 00:06:35,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-04-12 00:06:35,150 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:35,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2018-04-12 00:06:35,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 00:06:35,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 00:06:35,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-04-12 00:06:35,151 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand 17 states. [2018-04-12 00:06:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:35,599 INFO L93 Difference]: Finished difference Result 217 states and 228 transitions. [2018-04-12 00:06:35,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 00:06:35,600 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-04-12 00:06:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:35,601 INFO L225 Difference]: With dead ends: 217 [2018-04-12 00:06:35,601 INFO L226 Difference]: Without dead ends: 213 [2018-04-12 00:06:35,602 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2018-04-12 00:06:35,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-12 00:06:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 157. [2018-04-12 00:06:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-12 00:06:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2018-04-12 00:06:35,613 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 32 [2018-04-12 00:06:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:35,613 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2018-04-12 00:06:35,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 00:06:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2018-04-12 00:06:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-12 00:06:35,614 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:35,614 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] [2018-04-12 00:06:35,614 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:35,614 INFO L82 PathProgramCache]: Analyzing trace with hash 368107274, 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-04-12 00:06:35,622 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:35,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:35,683 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 17 treesize of output 13 [2018-04-12 00:06:35,697 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 13 treesize of output 5 [2018-04-12 00:06:35,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:35,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:35,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:35,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-12 00:06:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:35,714 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:35,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 16 treesize of output 11 [2018-04-12 00:06:35,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:35,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:35,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-04-12 00:06:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:35,753 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:35,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-12 00:06:35,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 00:06:35,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 00:06:35,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 00:06:35,753 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand 5 states. [2018-04-12 00:06:35,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:35,829 INFO L93 Difference]: Finished difference Result 165 states and 183 transitions. [2018-04-12 00:06:35,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:06:35,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-04-12 00:06:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:35,830 INFO L225 Difference]: With dead ends: 165 [2018-04-12 00:06:35,830 INFO L226 Difference]: Without dead ends: 164 [2018-04-12 00:06:35,831 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 00:06:35,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-12 00:06:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2018-04-12 00:06:35,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-12 00:06:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 173 transitions. [2018-04-12 00:06:35,843 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 173 transitions. Word has length 35 [2018-04-12 00:06:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:35,843 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 173 transitions. [2018-04-12 00:06:35,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 00:06:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 173 transitions. [2018-04-12 00:06:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-12 00:06:35,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:35,844 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] [2018-04-12 00:06:35,844 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:35,844 INFO L82 PathProgramCache]: Analyzing trace with hash 368107275, 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-04-12 00:06:35,851 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:35,865 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:35,879 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 23 treesize of output 19 [2018-04-12 00:06:35,880 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 19 treesize of output 11 [2018-04-12 00:06:35,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:35,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:35,886 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 28 treesize of output 22 [2018-04-12 00:06:35,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-12 00:06:35,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:35,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:35,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:35,894 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-12 00:06:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:35,901 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:35,905 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 24 treesize of output 22 [2018-04-12 00:06:35,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:35,919 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 30 treesize of output 34 [2018-04-12 00:06:35,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:35,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:06:35,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2018-04-12 00:06:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:35,972 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:35,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-12 00:06:35,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 00:06:35,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 00:06:35,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 00:06:35,973 INFO L87 Difference]: Start difference. First operand 156 states and 173 transitions. Second operand 6 states. [2018-04-12 00:06:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:36,071 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2018-04-12 00:06:36,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 00:06:36,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-04-12 00:06:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:36,072 INFO L225 Difference]: With dead ends: 164 [2018-04-12 00:06:36,072 INFO L226 Difference]: Without dead ends: 163 [2018-04-12 00:06:36,073 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 00:06:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-12 00:06:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2018-04-12 00:06:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-12 00:06:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2018-04-12 00:06:36,085 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 35 [2018-04-12 00:06:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:36,085 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2018-04-12 00:06:36,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 00:06:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2018-04-12 00:06:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-12 00:06:36,086 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:36,086 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] [2018-04-12 00:06:36,086 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:36,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1208494531, 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-04-12 00:06:36,101 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:36,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:36,118 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:36,141 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:36,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-12 00:06:36,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 00:06:36,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 00:06:36,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 00:06:36,141 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand 3 states. [2018-04-12 00:06:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:36,177 INFO L93 Difference]: Finished difference Result 324 states and 351 transitions. [2018-04-12 00:06:36,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 00:06:36,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-04-12 00:06:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:36,178 INFO L225 Difference]: With dead ends: 324 [2018-04-12 00:06:36,178 INFO L226 Difference]: Without dead ends: 238 [2018-04-12 00:06:36,179 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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-04-12 00:06:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-12 00:06:36,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 174. [2018-04-12 00:06:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-12 00:06:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 192 transitions. [2018-04-12 00:06:36,188 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 192 transitions. Word has length 36 [2018-04-12 00:06:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:36,188 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 192 transitions. [2018-04-12 00:06:36,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 00:06:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 192 transitions. [2018-04-12 00:06:36,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-12 00:06:36,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:36,189 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] [2018-04-12 00:06:36,189 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:36,189 INFO L82 PathProgramCache]: Analyzing trace with hash -429642429, 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-04-12 00:06:36,200 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:36,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:36,304 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-04-12 00:06:36,318 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-04-12 00:06:36,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,368 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-04-12 00:06:36,369 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-04-12 00:06:36,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-12 00:06:36,444 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-04-12 00:06:36,446 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-04-12 00:06:36,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-04-12 00:06:36,473 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-04-12 00:06:36,475 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-04-12 00:06:36,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,484 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-04-12 00:06:36,488 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-04-12 00:06:36,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:11 [2018-04-12 00:06:36,512 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-04-12 00:06:36,514 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-04-12 00:06:36,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-12 00:06:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:36,526 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:36,636 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 26 treesize of output 20 [2018-04-12 00:06:36,638 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 1 [2018-04-12 00:06:36,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,641 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 26 treesize of output 20 [2018-04-12 00:06:36,642 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 1 [2018-04-12 00:06:36,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:36,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:06:36,651 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-04-12 00:06:36,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-04-12 00:06:36,716 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:36,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 9] imperfect sequences [] total 18 [2018-04-12 00:06:36,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 00:06:36,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 00:06:36,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-04-12 00:06:36,717 INFO L87 Difference]: Start difference. First operand 174 states and 192 transitions. Second operand 18 states. [2018-04-12 00:06:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:37,148 INFO L93 Difference]: Finished difference Result 256 states and 270 transitions. [2018-04-12 00:06:37,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 00:06:37,148 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-04-12 00:06:37,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:37,149 INFO L225 Difference]: With dead ends: 256 [2018-04-12 00:06:37,149 INFO L226 Difference]: Without dead ends: 218 [2018-04-12 00:06:37,150 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2018-04-12 00:06:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-12 00:06:37,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 174. [2018-04-12 00:06:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-12 00:06:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2018-04-12 00:06:37,159 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 39 [2018-04-12 00:06:37,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:37,159 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 191 transitions. [2018-04-12 00:06:37,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 00:06:37,159 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 191 transitions. [2018-04-12 00:06:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 00:06:37,160 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:37,160 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-12 00:06:37,160 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:37,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2012532746, 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-04-12 00:06:37,175 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:37,193 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:37,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:06:37,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:06:37,204 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-04-12 00:06:37,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 00:06:37,221 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-04-12 00:06:37,222 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 8 treesize of output 7 [2018-04-12 00:06:37,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 00:06:37,264 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 37 treesize of output 33 [2018-04-12 00:06:37,266 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 12 treesize of output 11 [2018-04-12 00:06:37,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:06:37,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-12 00:06:37,303 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 36 treesize of output 24 [2018-04-12 00:06:37,308 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-04-12 00:06:37,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,314 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 5 treesize of output 1 [2018-04-12 00:06:37,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,321 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-04-12 00:06:37,321 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-12 00:06:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:37,360 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:37,450 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 33 treesize of output 27 [2018-04-12 00:06:37,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 9 treesize of output 8 [2018-04-12 00:06:37,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,478 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 18 treesize of output 22 [2018-04-12 00:06:37,480 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-04-12 00:06:37,480 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:06:37,489 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 9 [2018-04-12 00:06:37,489 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,499 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 14 treesize of output 14 [2018-04-12 00:06:37,500 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 00:06:37,507 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 00:06:37,509 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 17 treesize of output 15 [2018-04-12 00:06:37,510 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-04-12 00:06:37,511 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,513 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:37,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-04-12 00:06:37,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-04-12 00:06:37,557 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:33, output treesize:76 [2018-04-12 00:06:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:37,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 00:06:37,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-04-12 00:06:37,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 00:06:37,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 00:06:37,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-04-12 00:06:37,663 INFO L87 Difference]: Start difference. First operand 174 states and 191 transitions. Second operand 19 states. [2018-04-12 00:06:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:38,846 INFO L93 Difference]: Finished difference Result 376 states and 410 transitions. [2018-04-12 00:06:38,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 00:06:38,847 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-04-12 00:06:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:38,850 INFO L225 Difference]: With dead ends: 376 [2018-04-12 00:06:38,852 INFO L226 Difference]: Without dead ends: 375 [2018-04-12 00:06:38,853 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=921, Unknown=0, NotChecked=0, Total=1260 [2018-04-12 00:06:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-04-12 00:06:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 252. [2018-04-12 00:06:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-12 00:06:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 279 transitions. [2018-04-12 00:06:38,874 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 279 transitions. Word has length 42 [2018-04-12 00:06:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:38,875 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 279 transitions. [2018-04-12 00:06:38,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 00:06:38,875 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 279 transitions. [2018-04-12 00:06:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 00:06:38,876 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:38,876 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-12 00:06:38,876 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2012532745, 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-04-12 00:06:38,886 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:38,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:38,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 6 treesize of output 5 [2018-04-12 00:06:38,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:38,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:06:38,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:06:38,976 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-04-12 00:06:38,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:38,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:38,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 00:06:39,008 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-04-12 00:06:39,011 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 8 treesize of output 7 [2018-04-12 00:06:39,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,031 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-04-12 00:06:39,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 8 treesize of output 7 [2018-04-12 00:06:39,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,047 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 00:06:39,115 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-04-12 00:06:39,117 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 12 treesize of output 11 [2018-04-12 00:06:39,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,147 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 27 treesize of output 28 [2018-04-12 00:06:39,150 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 12 treesize of output 11 [2018-04-12 00:06:39,151 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:06:39,167 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-12 00:06:39,211 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 47 treesize of output 33 [2018-04-12 00:06:39,214 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 28 treesize of output 17 [2018-04-12 00:06:39,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,223 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 5 treesize of output 1 [2018-04-12 00:06:39,223 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,246 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 22 treesize of output 20 [2018-04-12 00:06:39,248 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-04-12 00:06:39,249 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,263 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 5 treesize of output 1 [2018-04-12 00:06:39,263 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,265 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,278 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-12 00:06:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:39,334 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:39,629 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 63 treesize of output 57 [2018-04-12 00:06:39,648 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-04-12 00:06:39,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,668 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 48 treesize of output 52 [2018-04-12 00:06:39,670 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-04-12 00:06:39,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,681 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 39 [2018-04-12 00:06:39,681 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:06:39,697 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 44 treesize of output 44 [2018-04-12 00:06:39,697 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 00:06:39,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 00:06:39,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 17 treesize of output 15 [2018-04-12 00:06:39,718 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-04-12 00:06:39,718 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,722 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-04-12 00:06:39,804 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 33 treesize of output 27 [2018-04-12 00:06:39,817 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-04-12 00:06:39,817 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,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 17 treesize of output 15 [2018-04-12 00:06:39,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 6 treesize of output 1 [2018-04-12 00:06:39,830 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,832 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,836 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 18 treesize of output 22 [2018-04-12 00:06:39,842 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 14 treesize of output 14 [2018-04-12 00:06:39,843 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:39,851 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-04-12 00:06:39,851 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,858 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 10 treesize of output 3 [2018-04-12 00:06:39,858 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,862 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:06:39,872 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-04-12 00:06:39,933 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 42 treesize of output 35 [2018-04-12 00:06:39,952 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 9 treesize of output 8 [2018-04-12 00:06:39,952 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,974 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 20 treesize of output 24 [2018-04-12 00:06:39,979 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 13 [2018-04-12 00:06:39,980 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:39,999 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 13 treesize of output 11 [2018-04-12 00:06:39,999 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,014 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-04-12 00:06:40,015 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,017 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,020 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,029 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 42 treesize of output 35 [2018-04-12 00:06:40,076 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-04-12 00:06:40,077 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,085 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 20 treesize of output 19 [2018-04-12 00:06:40,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-04-12 00:06:40,088 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,093 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 9 treesize of output 7 [2018-04-12 00:06:40,093 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,094 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,097 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,100 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 35 treesize of output 29 [2018-04-12 00:06:40,113 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-04-12 00:06:40,114 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,126 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 17 treesize of output 15 [2018-04-12 00:06:40,128 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-04-12 00:06:40,128 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,131 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-04-12 00:06:40,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 19 treesize of output 13 [2018-04-12 00:06:40,140 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,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, 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-04-12 00:06:40,152 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:40,159 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 13 treesize of output 11 [2018-04-12 00:06:40,160 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,164 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:06:40,176 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-04-12 00:06:40,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-04-12 00:06:40,220 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 5 variables, input treesize:97, output treesize:75 [2018-04-12 00:06:40,327 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-12 00:06:40,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:40,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:1 [2018-04-12 00:06:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:40,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 00:06:40,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-04-12 00:06:40,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 00:06:40,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 00:06:40,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-04-12 00:06:40,358 INFO L87 Difference]: Start difference. First operand 252 states and 279 transitions. Second operand 20 states. [2018-04-12 00:06:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:41,686 INFO L93 Difference]: Finished difference Result 352 states and 384 transitions. [2018-04-12 00:06:41,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 00:06:41,699 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-04-12 00:06:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:41,701 INFO L225 Difference]: With dead ends: 352 [2018-04-12 00:06:41,701 INFO L226 Difference]: Without dead ends: 350 [2018-04-12 00:06:41,702 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=250, Invalid=1156, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 00:06:41,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-12 00:06:41,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 266. [2018-04-12 00:06:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-12 00:06:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 294 transitions. [2018-04-12 00:06:41,723 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 294 transitions. Word has length 42 [2018-04-12 00:06:41,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:41,723 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 294 transitions. [2018-04-12 00:06:41,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 00:06:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 294 transitions. [2018-04-12 00:06:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-12 00:06:41,724 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:41,724 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] [2018-04-12 00:06:41,724 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:41,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1001533579, 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-04-12 00:06:41,733 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:41,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:41,774 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 17 treesize of output 13 [2018-04-12 00:06:41,776 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 13 treesize of output 5 [2018-04-12 00:06:41,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:41,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:41,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:41,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-12 00:06:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:41,793 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:41,797 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-04-12 00:06:41,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:41,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:41,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-04-12 00:06:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:41,852 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:41,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-12 00:06:41,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 00:06:41,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 00:06:41,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 00:06:41,854 INFO L87 Difference]: Start difference. First operand 266 states and 294 transitions. Second operand 6 states. [2018-04-12 00:06:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:42,037 INFO L93 Difference]: Finished difference Result 270 states and 298 transitions. [2018-04-12 00:06:42,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 00:06:42,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-04-12 00:06:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:42,038 INFO L225 Difference]: With dead ends: 270 [2018-04-12 00:06:42,039 INFO L226 Difference]: Without dead ends: 269 [2018-04-12 00:06:42,039 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-04-12 00:06:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-12 00:06:42,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-04-12 00:06:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-12 00:06:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 293 transitions. [2018-04-12 00:06:42,051 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 293 transitions. Word has length 45 [2018-04-12 00:06:42,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:42,051 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 293 transitions. [2018-04-12 00:06:42,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 00:06:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 293 transitions. [2018-04-12 00:06:42,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-12 00:06:42,052 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:42,052 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] [2018-04-12 00:06:42,052 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:42,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1001533580, 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-04-12 00:06:42,073 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:42,091 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:42,194 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 23 treesize of output 19 [2018-04-12 00:06:42,197 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 19 treesize of output 11 [2018-04-12 00:06:42,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,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 28 treesize of output 22 [2018-04-12 00:06:42,206 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 22 treesize of output 13 [2018-04-12 00:06:42,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-12 00:06:42,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:42,228 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:42,234 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 24 treesize of output 22 [2018-04-12 00:06:42,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,357 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 30 treesize of output 34 [2018-04-12 00:06:42,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:42,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:06:42,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2018-04-12 00:06:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:42,525 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-12 00:06:42,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2018-04-12 00:06:42,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 00:06:42,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 00:06:42,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-12 00:06:42,526 INFO L87 Difference]: Start difference. First operand 266 states and 293 transitions. Second operand 7 states. [2018-04-12 00:06:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:06:42,701 INFO L93 Difference]: Finished difference Result 271 states and 298 transitions. [2018-04-12 00:06:42,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 00:06:42,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-04-12 00:06:42,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:06:42,702 INFO L225 Difference]: With dead ends: 271 [2018-04-12 00:06:42,703 INFO L226 Difference]: Without dead ends: 270 [2018-04-12 00:06:42,703 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-04-12 00:06:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-04-12 00:06:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2018-04-12 00:06:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-12 00:06:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 294 transitions. [2018-04-12 00:06:42,716 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 294 transitions. Word has length 45 [2018-04-12 00:06:42,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:06:42,717 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 294 transitions. [2018-04-12 00:06:42,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 00:06:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 294 transitions. [2018-04-12 00:06:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 00:06:42,717 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:06:42,717 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-12 00:06:42,718 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:06:42,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1547982193, 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-04-12 00:06:42,724 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:06:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:06:42,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:06:42,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:06:42,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:06:42,761 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-04-12 00:06:42,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 00:06:42,774 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-04-12 00:06:42,776 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 8 treesize of output 7 [2018-04-12 00:06:42,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,786 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-04-12 00:06:42,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 8 treesize of output 7 [2018-04-12 00:06:42,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,790 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-12 00:06:42,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-04-12 00:06:42,835 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 16 treesize of output 15 [2018-04-12 00:06:42,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,850 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 46 treesize of output 47 [2018-04-12 00:06:42,853 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 16 treesize of output 15 [2018-04-12 00:06:42,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,867 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:46 [2018-04-12 00:06:42,891 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 45 treesize of output 39 [2018-04-12 00:06:42,893 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 7 treesize of output 1 [2018-04-12 00:06:42,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,899 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 24 treesize of output 15 [2018-04-12 00:06:42,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 00:06:42,908 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:35 [2018-04-12 00:06:42,956 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 31 treesize of output 22 [2018-04-12 00:06:42,958 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-04-12 00:06:42,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,964 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-04-12 00:06:42,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:42,970 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-04-12 00:06:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:06:42,989 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:06:43,015 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 24 treesize of output 19 [2018-04-12 00:06:43,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:43,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:06:43,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:15 [2018-04-12 00:06:43,104 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 65 [2018-04-12 00:06:43,130 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-04-12 00:06:43,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:43,172 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 87 treesize of output 126 [2018-04-12 00:06:43,189 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 2 case distinctions, treesize of input 97 treesize of output 103 [2018-04-12 00:06:43,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:43,372 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 3 case distinctions, treesize of input 92 treesize of output 100 [2018-04-12 00:06:43,373 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:43,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 98 treesize of output 97 [2018-04-12 00:06:43,537 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:43,678 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 93 treesize of output 94 [2018-04-12 00:06:43,679 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:43,839 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 63 treesize of output 71 [2018-04-12 00:06:43,845 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-04-12 00:06:43,846 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:43,893 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 53 treesize of output 47 [2018-04-12 00:06:43,893 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:43,937 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:06:43,943 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 58 treesize of output 86 [2018-04-12 00:06:43,944 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:43,991 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:06:44,009 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 121 [2018-04-12 00:06:44,010 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 3 xjuncts. [2018-04-12 00:06:44,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 47 treesize of output 41 [2018-04-12 00:06:44,066 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:44,127 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 58 treesize of output 53 [2018-04-12 00:06:44,127 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:44,167 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 75 treesize of output 69 [2018-04-12 00:06:44,167 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:44,197 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 50 treesize of output 38 [2018-04-12 00:06:44,198 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:44,212 INFO L267 ElimStorePlain]: Start of recursive call 9: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:06:44,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:06:44,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 128 [2018-04-12 00:06:45,562 WARN L151 SmtUtils]: Spent 1178ms on a formula simplification. DAG size of input: 390 DAG size of output 386 [2018-04-12 00:06:45,583 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 4 case distinctions, treesize of input 51 treesize of output 129 [2018-04-12 00:06:45,585 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 10 xjuncts. [2018-04-12 00:06:46,257 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 49 treesize of output 82 [2018-04-12 00:06:46,258 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 3 xjuncts. [2018-04-12 00:06:47,187 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 46 treesize of output 79 [2018-04-12 00:06:47,188 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 3 xjuncts. [2018-04-12 00:06:47,273 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 79 treesize of output 116 [2018-04-12 00:06:47,274 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 3 xjuncts. [2018-04-12 00:06:47,524 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 1 case distinctions, treesize of input 84 treesize of output 84 [2018-04-12 00:06:47,524 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:47,786 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 48 treesize of output 44 [2018-04-12 00:06:47,786 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:47,872 INFO L267 ElimStorePlain]: Start of recursive call 18: 36 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:06:48,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 132 [2018-04-12 00:06:48,007 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-12 00:06:52,921 WARN L151 SmtUtils]: Spent 4889ms on a formula simplification. DAG size of input: 807 DAG size of output 788 [2018-04-12 00:06:52,944 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 122 [2018-04-12 00:06:52,945 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 3 xjuncts. [2018-04-12 00:06:54,296 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 92 [2018-04-12 00:06:54,297 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:55,494 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:06:55,495 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:06:55,501 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 1 case distinctions, treesize of input 54 treesize of output 82 [2018-04-12 00:06:55,502 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:56,694 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 119 [2018-04-12 00:06:56,695 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 3 xjuncts. [2018-04-12 00:06:56,702 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 1 case distinctions, treesize of input 78 treesize of output 78 [2018-04-12 00:06:56,703 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-12 00:06:57,770 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 43 treesize of output 41 [2018-04-12 00:06:57,770 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-12 00:06:59,931 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 2 case distinctions, treesize of input 90 treesize of output 93 [2018-04-12 00:06:59,932 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:00,120 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 71 treesize of output 41 [2018-04-12 00:07:00,120 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:00,407 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 1 case distinctions, treesize of input 74 treesize of output 74 [2018-04-12 00:07:00,408 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:00,596 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 4 case distinctions, treesize of input 51 treesize of output 129 [2018-04-12 00:07:00,597 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 7 xjuncts. [2018-04-12 00:07:00,859 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 82 treesize of output 52 [2018-04-12 00:07:00,859 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:00,897 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 49 treesize of output 54 [2018-04-12 00:07:00,897 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:01,701 INFO L267 ElimStorePlain]: Start of recursive call 25: 82 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:07:01,789 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 98 treesize of output 108 [2018-04-12 00:07:01,949 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 110 DAG size of output 106 [2018-04-12 00:07:01,962 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 46 treesize of output 79 [2018-04-12 00:07:01,963 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:02,018 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 1 case distinctions, treesize of input 81 treesize of output 81 [2018-04-12 00:07:02,019 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:02,067 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 76 treesize of output 113 [2018-04-12 00:07:02,068 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:02,159 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 73 treesize of output 69 [2018-04-12 00:07:02,160 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:02,205 INFO L267 ElimStorePlain]: Start of recursive call 38: 10 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:02,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 131 [2018-04-12 00:07:02,296 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-12 00:07:02,342 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 4 case distinctions, treesize of input 85 treesize of output 132 [2018-04-12 00:07:02,345 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 7 xjuncts. [2018-04-12 00:07:03,883 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 62 treesize of output 97 [2018-04-12 00:07:03,884 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:05,292 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 4 case distinctions, treesize of input 56 treesize of output 132 [2018-04-12 00:07:05,294 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 10 xjuncts. [2018-04-12 00:07:06,406 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 85 treesize of output 79 [2018-04-12 00:07:06,406 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:09,698 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 90 treesize of output 60 [2018-04-12 00:07:09,698 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:10,519 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 54 treesize of output 52 [2018-04-12 00:07:10,520 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:11,348 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 65 treesize of output 59 [2018-04-12 00:07:11,348 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:13,006 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:13,007 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:13,012 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 1 case distinctions, treesize of input 49 treesize of output 77 [2018-04-12 00:07:13,012 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:14,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 68 [2018-04-12 00:07:14,431 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:14,842 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 65 treesize of output 59 [2018-04-12 00:07:14,843 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:15,266 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 1 case distinctions, treesize of input 62 treesize of output 60 [2018-04-12 00:07:15,267 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:15,690 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 46 treesize of output 41 [2018-04-12 00:07:15,690 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:15,906 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-04-12 00:07:15,906 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:16,073 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 41 treesize of output 35 [2018-04-12 00:07:16,073 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:16,437 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 82 treesize of output 87 [2018-04-12 00:07:16,438 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:16,466 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 69 treesize of output 39 [2018-04-12 00:07:16,467 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,164 INFO L267 ElimStorePlain]: Start of recursive call 43: 98 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 00:07:17,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,204 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 71 treesize of output 85 [2018-04-12 00:07:17,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 67 treesize of output 66 [2018-04-12 00:07:17,208 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:17,242 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 2 case distinctions, treesize of input 66 treesize of output 72 [2018-04-12 00:07:17,242 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:17,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 98 [2018-04-12 00:07:18,983 WARN L151 SmtUtils]: Spent 1662ms on a formula simplification. DAG size of input: 438 DAG size of output 421 [2018-04-12 00:07:18,990 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 59 treesize of output 59 [2018-04-12 00:07:18,991 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:19,550 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:19,553 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:19,565 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 127 [2018-04-12 00:07:19,566 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 5 xjuncts. [2018-04-12 00:07:20,080 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 4 case distinctions, treesize of input 51 treesize of output 129 [2018-04-12 00:07:20,082 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 7 xjuncts. [2018-04-12 00:07:20,440 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 64 treesize of output 34 [2018-04-12 00:07:20,440 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:20,732 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 54 treesize of output 91 [2018-04-12 00:07:20,746 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:21,225 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 64 treesize of output 34 [2018-04-12 00:07:21,226 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:21,669 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 20 treesize of output 16 [2018-04-12 00:07:21,670 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:22,269 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 2 case distinctions, treesize of input 26 treesize of output 29 [2018-04-12 00:07:22,269 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:22,565 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 2 case distinctions, treesize of input 26 treesize of output 29 [2018-04-12 00:07:22,566 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:22,696 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2018-04-12 00:07:22,697 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:22,925 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 56 treesize of output 26 [2018-04-12 00:07:22,925 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:23,045 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 56 treesize of output 91 [2018-04-12 00:07:23,046 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:23,198 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 62 treesize of output 32 [2018-04-12 00:07:23,199 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:23,459 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 29 treesize of output 25 [2018-04-12 00:07:23,460 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:23,580 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:23,581 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 00:07:23,582 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:23,967 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 51 treesize of output 56 [2018-04-12 00:07:23,968 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:24,029 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 44 treesize of output 14 [2018-04-12 00:07:24,029 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,115 INFO L267 ElimStorePlain]: Start of recursive call 63: 46 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 00:07:24,164 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 63 treesize of output 75 [2018-04-12 00:07:24,167 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 61 treesize of output 57 [2018-04-12 00:07:24,167 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,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 51 treesize of output 45 [2018-04-12 00:07:24,202 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,234 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 56 treesize of output 50 [2018-04-12 00:07:24,235 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,270 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 58 treesize of output 51 [2018-04-12 00:07:24,271 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,299 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 45 treesize of output 15 [2018-04-12 00:07:24,300 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,325 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 48 treesize of output 43 [2018-04-12 00:07:24,326 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,349 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 45 treesize of output 15 [2018-04-12 00:07:24,350 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:24,367 INFO L267 ElimStorePlain]: Start of recursive call 81: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 00:07:24,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 97 [2018-04-12 00:07:24,444 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 4 case distinctions, treesize of input 59 treesize of output 135 [2018-04-12 00:07:24,445 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 7 xjuncts. [2018-04-12 00:07:24,969 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 67 treesize of output 58 [2018-04-12 00:07:24,970 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,435 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:25,436 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:25,436 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 67 treesize of output 58 [2018-04-12 00:07:25,436 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:25,894 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:25,894 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:25,895 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 62 treesize of output 53 [2018-04-12 00:07:25,895 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:26,353 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 53 treesize of output 55 [2018-04-12 00:07:26,353 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:27,095 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:27,097 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:27,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 130 [2018-04-12 00:07:27,110 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 5 xjuncts. [2018-04-12 00:07:27,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 65 [2018-04-12 00:07:27,443 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:27,746 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 62 treesize of output 56 [2018-04-12 00:07:27,746 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:28,325 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 56 treesize of output 91 [2018-04-12 00:07:28,325 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:28,538 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 59 treesize of output 94 [2018-04-12 00:07:28,539 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:28,993 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 41 treesize of output 35 [2018-04-12 00:07:28,993 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,130 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 26 treesize of output 22 [2018-04-12 00:07:29,131 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,263 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 10 [2018-04-12 00:07:29,263 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,368 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 2 case distinctions, treesize of input 59 treesize of output 62 [2018-04-12 00:07:29,368 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:29,466 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 43 treesize of output 13 [2018-04-12 00:07:29,467 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:29,705 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 4 case distinctions, treesize of input 51 treesize of output 129 [2018-04-12 00:07:29,706 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 10 xjuncts. [2018-04-12 00:07:30,407 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 51 treesize of output 21 [2018-04-12 00:07:30,408 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:30,559 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 62 treesize of output 55 [2018-04-12 00:07:30,559 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:30,625 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 49 treesize of output 19 [2018-04-12 00:07:30,626 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:30,719 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 10 [2018-04-12 00:07:30,719 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:30,976 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 18 treesize of output 23 [2018-04-12 00:07:30,976 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 3 xjuncts. [2018-04-12 00:07:31,127 INFO L267 ElimStorePlain]: Start of recursive call 89: 57 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-12 00:07:31,142 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-12 00:07:31,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-12 00:07:31,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-12 00:07:31,178 INFO L202 ElimStorePlain]: Needed 110 recursive calls to eliminate 2 variables, input treesize:87, output treesize:29 [2018-04-12 00:07:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:07:31,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 00:07:31,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-04-12 00:07:31,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 00:07:31,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 00:07:31,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-04-12 00:07:31,294 INFO L87 Difference]: Start difference. First operand 268 states and 294 transitions. Second operand 20 states. [2018-04-12 00:07:32,116 WARN L148 SmtUtils]: Spent 138ms on a formula simplification that was a NOOP. DAG size: 76 [2018-04-12 00:07:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 00:07:32,440 INFO L93 Difference]: Finished difference Result 372 states and 399 transitions. [2018-04-12 00:07:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 00:07:32,443 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-04-12 00:07:32,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 00:07:32,445 INFO L225 Difference]: With dead ends: 372 [2018-04-12 00:07:32,445 INFO L226 Difference]: Without dead ends: 371 [2018-04-12 00:07:32,446 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=323, Invalid=1399, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 00:07:32,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-12 00:07:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 269. [2018-04-12 00:07:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-04-12 00:07:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 296 transitions. [2018-04-12 00:07:32,467 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 296 transitions. Word has length 47 [2018-04-12 00:07:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 00:07:32,468 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 296 transitions. [2018-04-12 00:07:32,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 00:07:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 296 transitions. [2018-04-12 00:07:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 00:07:32,469 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 00:07:32,469 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-12 00:07:32,469 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 00:07:32,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1547982192, 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-04-12 00:07:32,477 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 00:07:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 00:07:32,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 00:07:32,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:32,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:32,519 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-04-12 00:07:32,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,534 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-04-12 00:07:32,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-04-12 00:07:32,555 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-04-12 00:07:32,557 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-04-12 00:07:32,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,571 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-04-12 00:07:32,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 8 treesize of output 7 [2018-04-12 00:07:32,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,584 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2018-04-12 00:07:32,634 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 47 treesize of output 48 [2018-04-12 00:07:32,636 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 16 treesize of output 15 [2018-04-12 00:07:32,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,664 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-04-12 00:07:32,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, 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 15 [2018-04-12 00:07:32,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,679 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:76, output treesize:60 [2018-04-12 00:07:32,749 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 78 treesize of output 63 [2018-04-12 00:07:32,752 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 19 treesize of output 3 [2018-04-12 00:07:32,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,760 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 40 treesize of output 32 [2018-04-12 00:07:32,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:07:32,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:07:32,778 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 23 treesize of output 19 [2018-04-12 00:07:32,780 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-04-12 00:07:32,780 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,784 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:07:32,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:07:32,792 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:90, output treesize:22 [2018-04-12 00:07:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 00:07:32,822 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-12 00:07:33,026 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 175 treesize of output 137 [2018-04-12 00:07:33,129 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 60 DAG size of output 54 [2018-04-12 00:07:33,131 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-04-12 00:07:33,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:33,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 190 treesize of output 244 [2018-04-12 00:07:33,220 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-12 00:07:33,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:33,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 195 treesize of output 283 [2018-04-12 00:07:33,266 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-12 00:07:34,179 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:34,179 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:34,180 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 198 treesize of output 211 [2018-04-12 00:07:34,180 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:35,020 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 198 treesize of output 279 [2018-04-12 00:07:35,022 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-12 00:07:36,001 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 204 treesize of output 203 [2018-04-12 00:07:36,002 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:36,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:36,985 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 246 [2018-04-12 00:07:36,986 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 00:07:37,951 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:37,952 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:37,952 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:37,953 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 197 treesize of output 215 [2018-04-12 00:07:37,953 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 00:07:38,872 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 2 case distinctions, treesize of input 203 treesize of output 209 [2018-04-12 00:07:38,872 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-12 00:07:39,798 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 237 [2018-04-12 00:07:39,798 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 00:07:40,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 00:07:40,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 208 treesize of output 224 [2018-04-12 00:07:40,808 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 186 treesize of output 217 [2018-04-12 00:07:40,811 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-12 00:07:41,228 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 4 case distinctions, treesize of input 186 treesize of output 255 [2018-04-12 00:07:41,233 INFO L267 ElimStorePlain]: Start of recursive call 15: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 11 xjuncts. [2018-04-12 00:07:41,993 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 4 case distinctions, treesize of input 189 treesize of output 258 [2018-04-12 00:07:41,997 INFO L267 ElimStorePlain]: Start of recursive call 16: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 11 xjuncts. [2018-04-12 00:07:43,262 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 181 treesize of output 214 [2018-04-12 00:07:43,264 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-12 00:07:44,737 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 4 case distinctions, treesize of input 186 treesize of output 258 [2018-04-12 00:07:44,742 INFO L267 ElimStorePlain]: Start of recursive call 18: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 10 xjuncts. [2018-04-12 00:07:47,580 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 4 case distinctions, treesize of input 181 treesize of output 252 [2018-04-12 00:07:47,584 INFO L267 ElimStorePlain]: Start of recursive call 19: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 11 xjuncts. [2018-04-12 00:07:53,300 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:53,300 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:07:53,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 178 [2018-04-12 00:07:53,301 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:07:57,609 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 4 case distinctions, treesize of input 184 treesize of output 255 [2018-04-12 00:07:57,613 INFO L267 ElimStorePlain]: Start of recursive call 21: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 11 xjuncts. [2018-04-12 00:08:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 158 [2018-04-12 00:08:07,368 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:08:15,616 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 191 treesize of output 161 [2018-04-12 00:08:15,616 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:08:24,096 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 178 treesize of output 148 [2018-04-12 00:08:24,096 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:08:33,259 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 4 case distinctions, treesize of input 183 treesize of output 255 [2018-04-12 00:08:33,263 INFO L267 ElimStorePlain]: Start of recursive call 25: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 10 xjuncts. [2018-04-12 00:08:45,953 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:08:45,956 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:08:45,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, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 189 treesize of output 253 [2018-04-12 00:08:45,972 INFO L267 ElimStorePlain]: Start of recursive call 26: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-04-12 00:09:03,342 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 1 case distinctions, treesize of input 158 treesize of output 150 [2018-04-12 00:09:03,343 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 00:09:17,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 148 [2018-04-12 00:09:17,518 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:09:34,787 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 186 treesize of output 217 [2018-04-12 00:09:34,788 INFO L267 ElimStorePlain]: Start of recursive call 29: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-12 00:09:50,010 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 1 case distinctions, treesize of input 191 treesize of output 183 [2018-04-12 00:09:50,011 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 00:10:06,812 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 178 treesize of output 148 [2018-04-12 00:10:06,813 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:10:06,820 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 176 treesize of output 146 [2018-04-12 00:10:06,820 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:10:25,291 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:10:25,294 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:10:25,309 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 253 [2018-04-12 00:10:25,312 INFO L267 ElimStorePlain]: Start of recursive call 33: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-04-12 00:10:45,908 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:10:45,911 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:10:45,926 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 3 case distinctions, treesize of input 184 treesize of output 250 [2018-04-12 00:10:45,929 INFO L267 ElimStorePlain]: Start of recursive call 34: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. Received shutdown request... [2018-04-12 00:10:53,370 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-12 00:10:53,370 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 00:10:53,374 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 00:10:53,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 12:10:53 BoogieIcfgContainer [2018-04-12 00:10:53,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 00:10:53,375 INFO L168 Benchmark]: Toolchain (without parser) took 264336.05 ms. Allocated memory was 305.7 MB in the beginning and 523.2 MB in the end (delta: 217.6 MB). Free memory was 243.2 MB in the beginning and 485.4 MB in the end (delta: -242.2 MB). Peak memory consumption was 330.6 MB. Max. memory is 5.3 GB. [2018-04-12 00:10:53,376 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 305.7 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 00:10:53,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.43 ms. Allocated memory is still 305.7 MB. Free memory was 243.2 MB in the beginning and 216.0 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 5.3 GB. [2018-04-12 00:10:53,377 INFO L168 Benchmark]: Boogie Preprocessor took 60.77 ms. Allocated memory is still 305.7 MB. Free memory was 216.0 MB in the beginning and 213.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-12 00:10:53,377 INFO L168 Benchmark]: RCFGBuilder took 688.67 ms. Allocated memory was 305.7 MB in the beginning and 469.2 MB in the end (delta: 163.6 MB). Free memory was 213.0 MB in the beginning and 391.1 MB in the end (delta: -178.0 MB). Peak memory consumption was 18.8 MB. Max. memory is 5.3 GB. [2018-04-12 00:10:53,378 INFO L168 Benchmark]: TraceAbstraction took 263237.34 ms. Allocated memory was 469.2 MB in the beginning and 523.2 MB in the end (delta: 54.0 MB). Free memory was 391.1 MB in the beginning and 485.4 MB in the end (delta: -94.4 MB). Peak memory consumption was 314.9 MB. Max. memory is 5.3 GB. [2018-04-12 00:10:53,379 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.21 ms. Allocated memory is still 305.7 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 344.43 ms. Allocated memory is still 305.7 MB. Free memory was 243.2 MB in the beginning and 216.0 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 60.77 ms. Allocated memory is still 305.7 MB. Free memory was 216.0 MB in the beginning and 213.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 688.67 ms. Allocated memory was 305.7 MB in the beginning and 469.2 MB in the end (delta: 163.6 MB). Free memory was 213.0 MB in the beginning and 391.1 MB in the end (delta: -178.0 MB). Peak memory consumption was 18.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 263237.34 ms. Allocated memory was 469.2 MB in the beginning and 523.2 MB in the end (delta: 54.0 MB). Free memory was 391.1 MB in the beginning and 485.4 MB in the end (delta: -94.4 MB). Peak memory consumption was 314.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1014]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1016]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1014]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1016]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 803. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 41 error locations. TIMEOUT Result, 263.1s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2098 SDtfs, 6329 SDslu, 8946 SDs, 0 SdLazy, 5255 SolverSat, 383 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1427 GetRequests, 1128 SyntacticMatches, 2 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=22, 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.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 1077 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 53.0s InterpolantComputationTime, 654 NumberOfCodeBlocks, 654 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1264 ConstructedInterpolants, 102 QuantifiedInterpolants, 472355 SizeOfPredicates, 204 NumberOfNonLiveVariables, 2285 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 44 InterpolantComputations, 38 PerfectInterpolantSequences, 8/26 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/sll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_00-10-53-386.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_00-10-53-386.csv Completed graceful shutdown