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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-07 02:14:12,475 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-07 02:14:12,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-07 02:14:12,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-07 02:14:12,493 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-07 02:14:12,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-07 02:14:12,496 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-07 02:14:12,498 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-07 02:14:12,504 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-07 02:14:12,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-07 02:14:12,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-07 02:14:12,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-07 02:14:12,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-07 02:14:12,512 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-07 02:14:12,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-07 02:14:12,524 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-07 02:14:12,526 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-07 02:14:12,528 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-07 02:14:12,530 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-07 02:14:12,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-07 02:14:12,540 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-07 02:14:12,540 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-07 02:14:12,540 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-07 02:14:12,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-07 02:14:12,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-07 02:14:12,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-07 02:14:12,545 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-07 02:14:12,545 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-07 02:14:12,546 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-07 02:14:12,546 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-07 02:14:12,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-07 02:14:12,547 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-07 02:14:12,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-07 02:14:12,597 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-07 02:14:12,597 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-07 02:14:12,597 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-07 02:14:12,598 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-07 02:14:12,598 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-07 02:14:12,599 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-07 02:14:12,601 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-07 02:14:12,602 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-07 02:14:12,602 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-07 02:14:12,602 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-07 02:14:12,602 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-07 02:14:12,603 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-07 02:14:12,603 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-07 02:14:12,603 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-07 02:14:12,603 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-07 02:14:12,604 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-07 02:14:12,604 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-07 02:14:12,604 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-07 02:14:12,604 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-07 02:14:12,604 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-07 02:14:12,605 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-07 02:14:12,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-07 02:14:12,606 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-07 02:14:12,606 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-07 02:14:12,606 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-07 02:14:12,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-07 02:14:12,607 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-07 02:14:12,607 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-07 02:14:12,607 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-07 02:14:12,607 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-07 02:14:12,608 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-07 02:14:12,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:14:12,608 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-07 02:14:12,611 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-07 02:14:12,611 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-07 02:14:12,611 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-07 02:14:12,611 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-07 02:14:12,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-07 02:14:12,668 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-07 02:14:12,675 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-07 02:14:12,677 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-07 02:14:12,677 INFO L276 PluginConnector]: CDTParser initialized [2018-04-07 02:14:12,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-04-07 02:14:13,047 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG98e7b2777 [2018-04-07 02:14:13,188 INFO L287 CDTParser]: IsIndexed: true [2018-04-07 02:14:13,189 INFO L288 CDTParser]: Found 1 translation units. [2018-04-07 02:14:13,189 INFO L168 CDTParser]: Scanning ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-04-07 02:14:13,190 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-07 02:14:13,190 INFO L215 ultiparseSymbolTable]: [2018-04-07 02:14:13,190 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-07 02:14:13,190 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-04-07 02:14:13,190 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo ('foo') in ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-04-07 02:14:13,191 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-07 02:14:13,191 INFO L233 ultiparseSymbolTable]: [2018-04-07 02:14:13,213 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG98e7b2777 [2018-04-07 02:14:13,219 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-07 02:14:13,222 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-04-07 02:14:13,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-07 02:14:13,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-07 02:14:13,230 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-07 02:14:13,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:14:13" (1/1) ... [2018-04-07 02:14:13,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb1c634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:14:13, skipping insertion in model container [2018-04-07 02:14:13,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:14:13" (1/1) ... [2018-04-07 02:14:13,255 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-07 02:14:13,272 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-07 02:14:13,451 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-07 02:14:13,490 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-07 02:14:13,501 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-07 02:14:13,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:14:13 WrapperNode [2018-04-07 02:14:13,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-07 02:14:13,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-07 02:14:13,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-07 02:14:13,513 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-07 02:14:13,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:14:13" (1/1) ... [2018-04-07 02:14:13,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:14:13" (1/1) ... [2018-04-07 02:14:13,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:14:13" (1/1) ... [2018-04-07 02:14:13,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:14:13" (1/1) ... [2018-04-07 02:14:13,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:14:13" (1/1) ... [2018-04-07 02:14:13,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:14:13" (1/1) ... [2018-04-07 02:14:13,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:14:13" (1/1) ... [2018-04-07 02:14:13,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-07 02:14:13,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-07 02:14:13,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-07 02:14:13,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-07 02:14:13,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:14:13" (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-07 02:14:13,617 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-07 02:14:13,617 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-07 02:14:13,617 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-04-07 02:14:13,618 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-07 02:14:13,618 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-04-07 02:14:13,618 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-07 02:14:13,618 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-07 02:14:13,618 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-07 02:14:13,618 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-07 02:14:13,618 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-07 02:14:13,619 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-07 02:14:13,619 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-07 02:14:13,619 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-07 02:14:14,009 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-07 02:14:14,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:14:14 BoogieIcfgContainer [2018-04-07 02:14:14,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-07 02:14:14,010 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-04-07 02:14:14,010 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-04-07 02:14:14,011 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-04-07 02:14:14,015 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:14:14" (1/1) ... [2018-04-07 02:14:14,023 INFO L139 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-04-07 02:14:14,023 INFO L140 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-04-07 02:14:14,040 INFO L299 apSepIcfgTransformer]: Heap separator: starting memloc-array-style preprocessing [2018-04-07 02:14:14,051 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-07 02:14:14,052 INFO L332 apSepIcfgTransformer]: finished MemlocArrayUpdater, created 0 location literals (each corresponds to one heap write) [2018-04-07 02:14:14,059 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-07 02:14:14,063 INFO L412 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-04-07 02:14:14,064 DEBUG L416 apSepIcfgTransformer]: storeIndexInfoToLocLiteral: Map: [2018-04-07 02:14:14,065 DEBUG L418 apSepIcfgTransformer]: edgeToIndexToStoreIndexInfo: NestedMap2: [2018-04-07 02:14:14,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-04-07 02:14:16,744 INFO L314 AbstractInterpreter]: Visited 71 different actions 195 times. Merged at 47 different actions 85 times. Never widened. Found 11 fixpoints after 6 different actions. Largest state had 21 variables. [2018-04-07 02:14:16,746 INFO L424 apSepIcfgTransformer]: finished equality analysis [2018-04-07 02:14:16,756 INFO L195 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-04-07 02:14:16,756 INFO L434 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-04-07 02:14:16,757 INFO L435 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-04-07 02:14:16,757 INFO L437 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2) (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 1, 1); srcloc: L16')) [2018-04-07 02:14:16,761 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_30 [2018-04-07 02:14:16,762 DEBUG L374 HeapPartitionManager]: with contents [NoStoreIndexInfo] [2018-04-07 02:14:16,762 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_30 [2018-04-07 02:14:16,762 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select (select |v_#memory_int_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2) (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 1, 1); srcloc: L16')) [2018-04-07 02:14:16,762 DEBUG L325 HeapPartitionManager]: write locations: [NoStoreIndexInfo] [2018-04-07 02:14:16,763 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_30 [2018-04-07 02:14:16,763 DEBUG L374 HeapPartitionManager]: with contents [NoStoreIndexInfo] [2018-04-07 02:14:16,763 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_30 [2018-04-07 02:14:16,763 DEBUG L324 HeapPartitionManager]: at dimension 1 for ((select (select |v_#memory_int_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2) (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 1, 1); srcloc: L16')) [2018-04-07 02:14:16,763 DEBUG L325 HeapPartitionManager]: write locations: [NoStoreIndexInfo] [2018-04-07 02:14:16,764 INFO L330 HeapPartitionManager]: partitioning result: [2018-04-07 02:14:16,764 INFO L335 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-04-07 02:14:16,764 INFO L344 HeapPartitionManager]: at dimension 0 [2018-04-07 02:14:16,764 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-04-07 02:14:16,765 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-07 02:14:16,765 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-07 02:14:16,765 DEBUG L356 HeapPartitionManager]: [NoStoreIndexInfo] [2018-04-07 02:14:16,765 INFO L344 HeapPartitionManager]: at dimension 1 [2018-04-07 02:14:16,765 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-04-07 02:14:16,765 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-07 02:14:16,766 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-07 02:14:16,766 DEBUG L356 HeapPartitionManager]: [NoStoreIndexInfo] [2018-04-07 02:14:16,767 INFO L131 ransitionTransformer]: executing heap partitioning transformation [2018-04-07 02:14:16,771 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,771 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,772 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,772 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,772 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,772 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,773 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,773 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,773 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,774 DEBUG L281 ransitionTransformer]: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] [2018-04-07 02:14:16,774 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,775 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,775 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,775 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,775 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,776 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,776 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,776 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~i~1=v_main_~i~1_9} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:14:16,776 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,776 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,777 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,777 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_1| (store |v_#valid_2| 0 0)) InVars {#valid=|v_#valid_2|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid] [2018-04-07 02:14:16,777 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,777 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,778 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,778 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[main_~b~0] [2018-04-07 02:14:16,778 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,778 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,778 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,778 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,779 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,779 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,779 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,779 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~buffer~0=v_main_~buffer~0_1} AuxVars[] AssignedVars[main_~buffer~0] [2018-04-07 02:14:16,779 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,779 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,780 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,780 DEBUG L281 ransitionTransformer]: Formula: (and (= 0 (select |v_#valid_16| |v_main_~#mask~0.base_5|)) (= |v_#length_5| (store |v_#length_6| |v_main_~#mask~0.base_5| 32)) (= 0 |v_main_~#mask~0.offset_5|) (not (= 0 |v_main_~#mask~0.base_5|)) (= |v_#valid_15| (store |v_#valid_16| |v_main_~#mask~0.base_5| 1))) InVars {#length=|v_#length_6|, #valid=|v_#valid_16|} OutVars{#length=|v_#length_5|, main_~#mask~0.base=|v_main_~#mask~0.base_5|, main_~#mask~0.offset=|v_main_~#mask~0.offset_5|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[main_~#mask~0.base, main_~#mask~0.offset, #valid, #length] [2018-04-07 02:14:16,780 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,780 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,781 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,781 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~c~0.offset=v_main_~c~0.offset_1, main_~c~0.base=v_main_~c~0.base_1} AuxVars[] AssignedVars[main_~c~0.base, main_~c~0.offset] [2018-04-07 02:14:16,781 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,781 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,782 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,782 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_10 0) InVars {} OutVars{main_~i~1=v_main_~i~1_10} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:14:16,782 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,782 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,782 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,782 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,783 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,783 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,783 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,783 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,783 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,784 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,784 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,784 DEBUG L281 ransitionTransformer]: Formula: (not (< v_main_~i~1_11 32)) InVars {main_~i~1=v_main_~i~1_11} OutVars{main_~i~1=v_main_~i~1_11} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,784 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,784 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,785 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,785 DEBUG L281 ransitionTransformer]: Formula: (< v_main_~i~1_12 32) InVars {main_~i~1=v_main_~i~1_12} OutVars{main_~i~1=v_main_~i~1_12} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,785 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,785 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,785 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,786 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_1 0) InVars {} OutVars{main_~i~1=v_main_~i~1_1} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:14:16,786 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,786 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,786 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,786 DEBUG L281 ransitionTransformer]: Formula: (and (= v_main_~c~0.offset_2 |v_main_~#mask~0.offset_6|) (= v_main_~c~0.base_2 |v_main_~#mask~0.base_6|)) InVars {main_~#mask~0.offset=|v_main_~#mask~0.offset_6|, main_~#mask~0.base=|v_main_~#mask~0.base_6|} OutVars{main_~c~0.offset=v_main_~c~0.offset_2, main_~c~0.base=v_main_~c~0.base_2, main_~#mask~0.offset=|v_main_~#mask~0.offset_6|, main_~#mask~0.base=|v_main_~#mask~0.base_6|} AuxVars[] AssignedVars[main_~c~0.base, main_~c~0.offset] [2018-04-07 02:14:16,787 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,787 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,787 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,787 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,787 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,787 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,788 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,788 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,788 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,788 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,788 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,789 DEBUG L281 ransitionTransformer]: Formula: (or (not (<= 0 v_main_~i~1_13)) (not (< v_main_~i~1_13 100))) InVars {main_~i~1=v_main_~i~1_13} OutVars{main_~i~1=v_main_~i~1_13} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,789 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,789 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,789 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,789 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,790 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,790 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,790 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,790 DEBUG L281 ransitionTransformer]: Formula: (not (< v_main_~i~1_2 32)) InVars {main_~i~1=v_main_~i~1_2} OutVars{main_~i~1=v_main_~i~1_2} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,790 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,790 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,791 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,791 DEBUG L281 ransitionTransformer]: Formula: (< v_main_~i~1_3 32) InVars {main_~i~1=v_main_~i~1_3} OutVars{main_~i~1=v_main_~i~1_3} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,791 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,791 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,791 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,792 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#res_2| 0) InVars {} OutVars{main_#res=|v_main_#res_2|} AuxVars[] AssignedVars[main_#res] [2018-04-07 02:14:16,792 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,792 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,792 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,793 DEBUG L281 ransitionTransformer]: Formula: (and (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~sizeInParam_1| 32) (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offsetInParam_1| v_main_~c~0.offset_4) (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.baseInParam_1| v_main_~c~0.base_4)) InVars {main_~c~0.offset=v_main_~c~0.offset_4, main_~c~0.base=v_main_~c~0.base_4} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.baseInParam_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offsetInParam_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~sizeInParam_1|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size] [2018-04-07 02:14:16,793 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,793 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,793 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,793 DEBUG L281 ransitionTransformer]: Formula: (or (not (< v_main_~i~1_4 100)) (not (<= 0 v_main_~i~1_4))) InVars {main_~i~1=v_main_~i~1_4} OutVars{main_~i~1=v_main_~i~1_4} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,794 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,794 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,794 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,794 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,794 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,794 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,795 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,795 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_11| (store |v_#valid_12| |v_main_~#mask~0.base_3| 0)) InVars {main_~#mask~0.base=|v_main_~#mask~0.base_3|, #valid=|v_#valid_12|} OutVars{main_~#mask~0.base=|v_main_~#mask~0.base_3|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#valid] [2018-04-07 02:14:16,795 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,795 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,795 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,796 DEBUG L281 ransitionTransformer]: Formula: (and (<= |v_main_#t~ret3_2| 2147483647) (<= 0 (+ |v_main_#t~ret3_2| 2147483648))) InVars {main_#t~ret3=|v_main_#t~ret3_2|} OutVars{main_#t~ret3=|v_main_#t~ret3_2|} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,796 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,796 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,796 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,796 DEBUG L281 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_1 |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size_1|) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size_1|} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size] [2018-04-07 02:14:16,797 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,797 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,797 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,797 DEBUG L281 ransitionTransformer]: Formula: (not (= 32 (select v_main_~b~0_1 v_main_~i~1_5))) InVars {main_~b~0=v_main_~b~0_1, main_~i~1=v_main_~i~1_5} OutVars{main_~b~0=v_main_~b~0_1, main_~i~1=v_main_~i~1_5} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,797 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,797 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,798 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,798 DEBUG L281 ransitionTransformer]: Formula: (= 32 (select v_main_~b~0_2 v_main_~i~1_6)) InVars {main_~b~0=v_main_~b~0_2, main_~i~1=v_main_~i~1_6} OutVars{main_~b~0=v_main_~b~0_2, main_~i~1=v_main_~i~1_6} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,798 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,798 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,798 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,799 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~#mask~0.base=|v_main_~#mask~0.base_4|, main_~#mask~0.offset=|v_main_~#mask~0.offset_4|} AuxVars[] AssignedVars[main_~#mask~0.base, main_~#mask~0.offset] [2018-04-07 02:14:16,799 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,799 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,799 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,799 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~b~0_4 (store v_main_~b~0_5 v_main_~i~1_14 |v_main_#t~ret3_3|)) InVars {main_~i~1=v_main_~i~1_14, main_~b~0=v_main_~b~0_5, main_#t~ret3=|v_main_#t~ret3_3|} OutVars{main_~i~1=v_main_~i~1_14, main_~b~0=v_main_~b~0_4, main_#t~ret3=|v_main_#t~ret3_3|} AuxVars[] AssignedVars[main_~b~0] [2018-04-07 02:14:16,799 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,800 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,800 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,800 DEBUG L281 ransitionTransformer]: Formula: (and (= v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_1 |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset_1|) (= v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_1 |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base_1|)) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset_1|} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_1, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset] [2018-04-07 02:14:16,800 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,800 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,801 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,801 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#res_1| 1) InVars {} OutVars{main_#res=|v_main_#res_1|} AuxVars[] AssignedVars[main_#res] [2018-04-07 02:14:16,801 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,801 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,801 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,802 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#t~post4_1| v_main_~i~1_7) InVars {main_~i~1=v_main_~i~1_7} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~1=v_main_~i~1_7} AuxVars[] AssignedVars[main_#t~post4] [2018-04-07 02:14:16,802 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,802 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,802 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,802 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_13| |old(#valid)|) InVars {#valid=|v_#valid_13|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_13|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,803 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,803 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,803 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,803 DEBUG L281 ransitionTransformer]: Formula: (not (= |v_#valid_14| |old(#valid)|)) InVars {#valid=|v_#valid_14|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_14|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,803 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,803 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,804 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,804 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~ret3=|v_main_#t~ret3_4|} AuxVars[] AssignedVars[main_#t~ret3] [2018-04-07 02:14:16,804 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,804 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,804 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,805 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0] [2018-04-07 02:14:16,805 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,805 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,805 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,805 DEBUG L281 ransitionTransformer]: Formula: (= (store |v_#valid_10| |v_main_~#mask~0.base_1| 0) |v_#valid_9|) InVars {main_~#mask~0.base=|v_main_~#mask~0.base_1|, #valid=|v_#valid_10|} OutVars{main_~#mask~0.base=|v_main_~#mask~0.base_1|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#valid] [2018-04-07 02:14:16,805 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,806 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,806 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,806 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_8 (+ |v_main_#t~post4_2| 1)) InVars {main_#t~post4=|v_main_#t~post4_2|} OutVars{main_#t~post4=|v_main_#t~post4_2|, main_~i~1=v_main_~i~1_8} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:14:16,806 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,806 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,807 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,807 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#t~post2_1| v_main_~i~1_15) InVars {main_~i~1=v_main_~i~1_15} OutVars{main_~i~1=v_main_~i~1_15, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2] [2018-04-07 02:14:16,807 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,807 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,807 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,807 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0] [2018-04-07 02:14:16,808 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,808 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,808 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,808 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~#mask~0.base=|v_main_~#mask~0.base_2|, main_~#mask~0.offset=|v_main_~#mask~0.offset_2|} AuxVars[] AssignedVars[main_~#mask~0.base, main_~#mask~0.offset] [2018-04-07 02:14:16,808 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,808 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,809 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,809 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~post4=|v_main_#t~post4_3|} AuxVars[] AssignedVars[main_#t~post4] [2018-04-07 02:14:16,809 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,809 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,809 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,810 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_16 (+ |v_main_#t~post2_2| 1)) InVars {main_#t~post2=|v_main_#t~post2_2|} OutVars{main_~i~1=v_main_~i~1_16, main_#t~post2=|v_main_#t~post2_2|} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:14:16,810 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,810 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,810 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,810 DEBUG L281 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_2 0) InVars {} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_2} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0] [2018-04-07 02:14:16,810 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,811 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,811 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,811 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~post2=|v_main_#t~post2_3|} AuxVars[] AssignedVars[main_#t~post2] [2018-04-07 02:14:16,811 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,811 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,811 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,812 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,812 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,812 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,812 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,812 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,812 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,813 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,813 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,813 DEBUG L281 ransitionTransformer]: Formula: (not (< v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_3 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_2)) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_3, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_2} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_3, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_2} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,813 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,813 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,814 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,814 DEBUG L281 ransitionTransformer]: Formula: (< v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_4 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_3) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_4, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_3} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_4, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size_3} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,814 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,814 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,814 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,814 DEBUG L281 ransitionTransformer]: Formula: (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#res_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_11) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_11} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#res=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#res_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_11} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#res] [2018-04-07 02:14:16,815 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,815 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,815 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,815 DEBUG L281 ransitionTransformer]: Formula: (or (not (<= 0 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_5)) (not (< v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_5 32))) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_5} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_5} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,815 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,816 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,816 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,816 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,816 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,816 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,816 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,817 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,817 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,817 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,820 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,820 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse0 (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2))) (and (<= 0 .cse0) (<= (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2 1) (select |v_#length_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2)) (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_1| (select (select |v_#memory_int_part_locs_30_locs_30_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2) .cse0)) (= 1 (select |v_#valid_3| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2)))) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2, #valid=|v_#valid_3|, #length=|v_#length_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_1|} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2, #valid=|v_#valid_3|, #length=|v_#length_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_1|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1] [2018-04-07 02:14:16,820 DEBUG L288 ransitionTransformer]: formula has changed [2018-04-07 02:14:16,821 DEBUG L289 ransitionTransformer]: old formula: [2018-04-07 02:14:16,821 DEBUG L290 ransitionTransformer]: (let ((.cse0 (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2))) (and (<= 0 .cse0) (<= (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2 1) (select |v_#length_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2)) (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_1| (select (select |v_#memory_int_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2) .cse0)) (= 1 (select |v_#valid_3| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2)))) [2018-04-07 02:14:16,821 DEBUG L291 ransitionTransformer]: new formula: [2018-04-07 02:14:16,821 DEBUG L292 ransitionTransformer]: (let ((.cse0 (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2))) (and (<= 0 .cse0) (<= (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2 1) (select |v_#length_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2)) (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_1| (select (select |v_#memory_int_part_locs_30_locs_30_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2) .cse0)) (= 1 (select |v_#valid_3| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2)))) [2018-04-07 02:14:16,821 DEBUG L296 ransitionTransformer]: invars have changed [2018-04-07 02:14:16,822 DEBUG L297 ransitionTransformer]: old invars: [2018-04-07 02:14:16,822 DEBUG L298 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6} [2018-04-07 02:14:16,822 DEBUG L299 ransitionTransformer]: new invars: [2018-04-07 02:14:16,822 DEBUG L300 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2, #valid=|v_#valid_3|, #length=|v_#length_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_1|} [2018-04-07 02:14:16,822 DEBUG L304 ransitionTransformer]: outvars have changed [2018-04-07 02:14:16,822 DEBUG L305 ransitionTransformer]: old outvars: [2018-04-07 02:14:16,823 DEBUG L306 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_1|} [2018-04-07 02:14:16,823 DEBUG L307 ransitionTransformer]: new outvars: [2018-04-07 02:14:16,823 DEBUG L308 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_2, #valid=|v_#valid_3|, #length=|v_#length_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_6, #memory_int_part_locs_30_locs_30=|v_#memory_int_part_locs_30_locs_30_1|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_1|} [2018-04-07 02:14:16,823 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,823 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,824 DEBUG L281 ransitionTransformer]: Formula: (not (= 1 (select |v_#valid_4| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_3))) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_3, #valid=|v_#valid_4|} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_3, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,824 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,824 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,824 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,824 DEBUG L281 ransitionTransformer]: Formula: (or (not (<= (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_7 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_3 1) (select |v_#length_2| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_4))) (not (<= 0 (+ v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_7 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_3)))) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_4, #length=|v_#length_2|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_7, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_3} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base_4, #length=|v_#length_2|, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_7, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset_3} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,824 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,825 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,825 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,825 DEBUG L281 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0_2 (store v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0_3 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_8 |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_2|)) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_8, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0_3, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_2|} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_8, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0_2, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_2|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~a~0] [2018-04-07 02:14:16,825 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,826 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,826 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,826 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1_3|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~mem1] [2018-04-07 02:14:16,826 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,826 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,827 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,827 DEBUG L281 ransitionTransformer]: Formula: (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0_1| v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_9) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_9} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_9, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0_1|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0] [2018-04-07 02:14:16,827 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,827 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,827 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,827 DEBUG L281 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_10 (+ |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0_2| 1)) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0_2|} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0_10, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0_2|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0] [2018-04-07 02:14:16,828 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,828 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,828 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,828 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0_3|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#t~post0] [2018-04-07 02:14:16,828 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,828 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,829 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,829 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:14:16,829 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,829 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,829 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,829 DEBUG L281 ransitionTransformer]: Formula: (= |v_ULTIMATE.start_#t~ret5_2| |v_main_#resOutParam_1|) InVars {main_#res=|v_main_#resOutParam_1|} OutVars{ULTIMATE.start_#t~ret5=|v_ULTIMATE.start_#t~ret5_2|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret5] [2018-04-07 02:14:16,830 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,830 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,830 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:14:16,830 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#t~ret3_5| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#resOutParam_1|) InVars {__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#res=|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#resOutParam_1|} OutVars{main_#t~ret3=|v_main_#t~ret3_5|} AuxVars[] AssignedVars[main_#t~ret3] [2018-04-07 02:14:16,830 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:14:16,830 DEBUG L310 ransitionTransformer]: [2018-04-07 02:14:16,831 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-07 02:14:16,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 02:14:16 BasicIcfg [2018-04-07 02:14:16,833 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-04-07 02:14:16,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-07 02:14:16,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-07 02:14:16,837 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-07 02:14:16,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 02:14:13" (1/4) ... [2018-04-07 02:14:16,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123c4d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:14:16, skipping insertion in model container [2018-04-07 02:14:16,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:14:13" (2/4) ... [2018-04-07 02:14:16,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123c4d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:14:16, skipping insertion in model container [2018-04-07 02:14:16,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:14:14" (3/4) ... [2018-04-07 02:14:16,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123c4d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 02:14:16, skipping insertion in model container [2018-04-07 02:14:16,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 02:14:16" (4/4) ... [2018-04-07 02:14:16,841 INFO L107 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-04-07 02:14:16,851 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-07 02:14:16,859 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-07 02:14:16,904 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-07 02:14:16,905 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-07 02:14:16,905 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-07 02:14:16,905 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-07 02:14:16,905 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-07 02:14:16,905 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-07 02:14:16,905 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-07 02:14:16,905 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-07 02:14:16,906 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-07 02:14:16,906 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-07 02:14:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-04-07 02:14:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-07 02:14:16,928 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:16,929 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:14:16,930 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:16,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1261173293, 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-07 02:14:16,952 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:16,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:17,035 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-07 02:14:17,035 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:17,071 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-07 02:14:17,111 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:14:17,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-04-07 02:14:17,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-07 02:14:17,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-07 02:14:17,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-07 02:14:17,130 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 5 states. [2018-04-07 02:14:17,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:17,262 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2018-04-07 02:14:17,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-07 02:14:17,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-07 02:14:17,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:17,277 INFO L225 Difference]: With dead ends: 141 [2018-04-07 02:14:17,277 INFO L226 Difference]: Without dead ends: 84 [2018-04-07 02:14:17,281 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-07 02:14:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-07 02:14:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2018-04-07 02:14:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-07 02:14:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-04-07 02:14:17,332 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 16 [2018-04-07 02:14:17,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:17,332 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-04-07 02:14:17,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-07 02:14:17,333 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-04-07 02:14:17,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-07 02:14:17,334 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:17,334 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:14:17,334 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:17,334 INFO L82 PathProgramCache]: Analyzing trace with hash -635853243, 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-07 02:14:17,349 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:17,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:17,412 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-07 02:14:17,413 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:17,448 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-07 02:14:17,486 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:14:17,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2018-04-07 02:14:17,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-07 02:14:17,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-07 02:14:17,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-07 02:14:17,494 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 4 states. [2018-04-07 02:14:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:17,644 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-04-07 02:14:17,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-07 02:14:17,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-07 02:14:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:17,648 INFO L225 Difference]: With dead ends: 82 [2018-04-07 02:14:17,648 INFO L226 Difference]: Without dead ends: 81 [2018-04-07 02:14:17,649 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-07 02:14:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-07 02:14:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2018-04-07 02:14:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-07 02:14:17,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-04-07 02:14:17,657 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-04-07 02:14:17,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:17,657 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-04-07 02:14:17,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-07 02:14:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-04-07 02:14:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-07 02:14:17,658 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:17,659 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] [2018-04-07 02:14:17,659 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:17,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1763386179, 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-07 02:14:17,695 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:17,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:17,748 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-07 02:14:17,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:14:17,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:14:17,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-07 02:14:17,843 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-07 02:14:17,844 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:17,908 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-07 02:14:17,934 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:14:17,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-07 02:14:17,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-07 02:14:17,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-07 02:14:17,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-07 02:14:17,935 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-04-07 02:14:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:18,197 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-04-07 02:14:18,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-07 02:14:18,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-07 02:14:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:18,199 INFO L225 Difference]: With dead ends: 71 [2018-04-07 02:14:18,199 INFO L226 Difference]: Without dead ends: 70 [2018-04-07 02:14:18,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-07 02:14:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-07 02:14:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-04-07 02:14:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-07 02:14:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-04-07 02:14:18,210 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 26 [2018-04-07 02:14:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:18,211 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-04-07 02:14:18,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-07 02:14:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-04-07 02:14:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-07 02:14:18,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:18,212 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] [2018-04-07 02:14:18,212 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:18,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1763386180, 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-07 02:14:18,220 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:18,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:18,246 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-07 02:14:18,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:14:18,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:14:18,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:14:18,380 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-07 02:14:18,380 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:18,522 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-07 02:14:18,557 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:14:18,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2018-04-07 02:14:18,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-07 02:14:18,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-07 02:14:18,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-04-07 02:14:18,558 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 12 states. [2018-04-07 02:14:18,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:18,875 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-04-07 02:14:18,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-07 02:14:18,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-04-07 02:14:18,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:18,876 INFO L225 Difference]: With dead ends: 79 [2018-04-07 02:14:18,876 INFO L226 Difference]: Without dead ends: 78 [2018-04-07 02:14:18,877 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-04-07 02:14:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-07 02:14:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2018-04-07 02:14:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-07 02:14:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-04-07 02:14:18,884 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 26 [2018-04-07 02:14:18,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:18,884 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-04-07 02:14:18,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-07 02:14:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-04-07 02:14:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-07 02:14:18,885 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:18,886 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] [2018-04-07 02:14:18,886 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:18,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1552158473, 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-07 02:14:18,895 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:18,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:18,920 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-07 02:14:18,921 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:18,956 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-07 02:14:18,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:14:18,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-04-07 02:14:18,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-07 02:14:18,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-07 02:14:18,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-07 02:14:18,979 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 8 states. [2018-04-07 02:14:19,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:19,110 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-04-07 02:14:19,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-07 02:14:19,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-04-07 02:14:19,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:19,142 INFO L225 Difference]: With dead ends: 105 [2018-04-07 02:14:19,142 INFO L226 Difference]: Without dead ends: 104 [2018-04-07 02:14:19,143 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-07 02:14:19,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-07 02:14:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 88. [2018-04-07 02:14:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-07 02:14:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-04-07 02:14:19,149 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 34 [2018-04-07 02:14:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:19,149 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-04-07 02:14:19,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-07 02:14:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-04-07 02:14:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-07 02:14:19,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:19,150 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:14:19,150 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:19,150 INFO L82 PathProgramCache]: Analyzing trace with hash -872272174, 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-07 02:14:19,156 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:19,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:19,175 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-07 02:14:19,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:14:19,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:14:19,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:14:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:19,298 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:19,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:14:19,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-04-07 02:14:19,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-07 02:14:19,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-07 02:14:19,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-04-07 02:14:19,465 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 16 states. [2018-04-07 02:14:19,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:19,774 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-04-07 02:14:19,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-07 02:14:19,775 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-04-07 02:14:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:19,776 INFO L225 Difference]: With dead ends: 99 [2018-04-07 02:14:19,776 INFO L226 Difference]: Without dead ends: 98 [2018-04-07 02:14:19,777 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-04-07 02:14:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-07 02:14:19,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2018-04-07 02:14:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-07 02:14:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-04-07 02:14:19,787 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 35 [2018-04-07 02:14:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:19,787 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-04-07 02:14:19,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-07 02:14:19,787 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-04-07 02:14:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-07 02:14:19,788 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:19,788 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:14:19,788 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:19,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1746619775, 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-07 02:14:19,796 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:19,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:19,836 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:19,932 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:14:19,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-07 02:14:19,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-07 02:14:19,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-07 02:14:19,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-07 02:14:19,933 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 8 states. [2018-04-07 02:14:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:20,027 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-04-07 02:14:20,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-07 02:14:20,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-04-07 02:14:20,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:20,029 INFO L225 Difference]: With dead ends: 165 [2018-04-07 02:14:20,029 INFO L226 Difference]: Without dead ends: 89 [2018-04-07 02:14:20,030 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-04-07 02:14:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-07 02:14:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-04-07 02:14:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-07 02:14:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2018-04-07 02:14:20,038 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 37 [2018-04-07 02:14:20,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:20,038 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2018-04-07 02:14:20,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-07 02:14:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2018-04-07 02:14:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-07 02:14:20,042 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:20,042 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:14:20,042 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:20,043 INFO L82 PathProgramCache]: Analyzing trace with hash 356680243, 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-07 02:14:20,049 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:20,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:20,098 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:20,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:14:20,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-04-07 02:14:20,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-07 02:14:20,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-07 02:14:20,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-04-07 02:14:20,198 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 12 states. [2018-04-07 02:14:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:20,337 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2018-04-07 02:14:20,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-07 02:14:20,338 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-04-07 02:14:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:20,339 INFO L225 Difference]: With dead ends: 168 [2018-04-07 02:14:20,339 INFO L226 Difference]: Without dead ends: 89 [2018-04-07 02:14:20,340 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2018-04-07 02:14:20,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-07 02:14:20,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-04-07 02:14:20,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-07 02:14:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-04-07 02:14:20,348 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 46 [2018-04-07 02:14:20,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:20,348 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-04-07 02:14:20,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-07 02:14:20,348 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-04-07 02:14:20,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-07 02:14:20,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:20,350 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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-07 02:14:20,350 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:20,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1816571721, now seen corresponding path program 2 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-07 02:14:20,365 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:20,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:20,469 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:20,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:14:20,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-04-07 02:14:20,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-07 02:14:20,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-07 02:14:20,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-07 02:14:20,597 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 16 states. [2018-04-07 02:14:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:20,946 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-04-07 02:14:20,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-07 02:14:20,946 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-04-07 02:14:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:20,948 INFO L225 Difference]: With dead ends: 146 [2018-04-07 02:14:20,948 INFO L226 Difference]: Without dead ends: 145 [2018-04-07 02:14:20,949 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2018-04-07 02:14:20,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-07 02:14:20,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 124. [2018-04-07 02:14:20,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-07 02:14:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-04-07 02:14:20,964 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 52 [2018-04-07 02:14:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:20,964 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-04-07 02:14:20,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-07 02:14:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-04-07 02:14:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-07 02:14:20,966 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:20,966 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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-07 02:14:20,966 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:20,967 INFO L82 PathProgramCache]: Analyzing trace with hash -479148270, now seen corresponding path program 2 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-07 02:14:20,976 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:20,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:21,004 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-07 02:14:21,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:14:21,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:14:21,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:14:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:21,154 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:21,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:14:21,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-04-07 02:14:21,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-07 02:14:21,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-07 02:14:21,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-04-07 02:14:21,410 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 24 states. [2018-04-07 02:14:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:22,677 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-04-07 02:14:22,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-07 02:14:22,677 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-04-07 02:14:22,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:22,679 INFO L225 Difference]: With dead ends: 138 [2018-04-07 02:14:22,679 INFO L226 Difference]: Without dead ends: 137 [2018-04-07 02:14:22,680 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=441, Invalid=1539, Unknown=0, NotChecked=0, Total=1980 [2018-04-07 02:14:22,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-07 02:14:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2018-04-07 02:14:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-07 02:14:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-04-07 02:14:22,693 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 53 [2018-04-07 02:14:22,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:22,694 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-04-07 02:14:22,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-07 02:14:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-04-07 02:14:22,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-07 02:14:22,696 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:22,696 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:14:22,696 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash 330187251, now seen corresponding path program 2 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-07 02:14:22,707 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:22,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:22,809 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:22,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:14:22,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-07 02:14:22,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-07 02:14:22,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-07 02:14:22,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-04-07 02:14:22,975 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 20 states. [2018-04-07 02:14:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:23,457 INFO L93 Difference]: Finished difference Result 240 states and 254 transitions. [2018-04-07 02:14:23,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-07 02:14:23,457 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-04-07 02:14:23,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:23,458 INFO L225 Difference]: With dead ends: 240 [2018-04-07 02:14:23,458 INFO L226 Difference]: Without dead ends: 125 [2018-04-07 02:14:23,459 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=432, Invalid=900, Unknown=0, NotChecked=0, Total=1332 [2018-04-07 02:14:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-07 02:14:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-04-07 02:14:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-07 02:14:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2018-04-07 02:14:23,467 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 64 [2018-04-07 02:14:23,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:23,468 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2018-04-07 02:14:23,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-07 02:14:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2018-04-07 02:14:23,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-07 02:14:23,469 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:23,469 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 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-07 02:14:23,469 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:23,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1545682889, now seen corresponding path program 3 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-07 02:14:23,477 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:23,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:23,610 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:23,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:14:23,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-04-07 02:14:23,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-07 02:14:23,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-07 02:14:23,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2018-04-07 02:14:23,916 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 32 states. [2018-04-07 02:14:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:25,445 INFO L93 Difference]: Finished difference Result 234 states and 252 transitions. [2018-04-07 02:14:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-07 02:14:25,446 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 88 [2018-04-07 02:14:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:25,447 INFO L225 Difference]: With dead ends: 234 [2018-04-07 02:14:25,447 INFO L226 Difference]: Without dead ends: 233 [2018-04-07 02:14:25,449 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1096, Invalid=3194, Unknown=0, NotChecked=0, Total=4290 [2018-04-07 02:14:25,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-07 02:14:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 196. [2018-04-07 02:14:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-07 02:14:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 214 transitions. [2018-04-07 02:14:25,458 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 214 transitions. Word has length 88 [2018-04-07 02:14:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:25,459 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 214 transitions. [2018-04-07 02:14:25,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-07 02:14:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 214 transitions. [2018-04-07 02:14:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-07 02:14:25,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:25,460 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 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-07 02:14:25,460 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:25,461 INFO L82 PathProgramCache]: Analyzing trace with hash -671529070, now seen corresponding path program 3 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-07 02:14:25,467 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:25,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:25,512 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-07 02:14:25,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:14:25,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:14:25,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:14:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:26,192 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:27,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:14:27,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-04-07 02:14:27,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-07 02:14:27,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-07 02:14:27,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1336, Unknown=0, NotChecked=0, Total=1560 [2018-04-07 02:14:27,162 INFO L87 Difference]: Start difference. First operand 196 states and 214 transitions. Second operand 40 states. [2018-04-07 02:14:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:29,983 INFO L93 Difference]: Finished difference Result 222 states and 240 transitions. [2018-04-07 02:14:29,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-07 02:14:29,984 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 89 [2018-04-07 02:14:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:29,985 INFO L225 Difference]: With dead ends: 222 [2018-04-07 02:14:29,985 INFO L226 Difference]: Without dead ends: 221 [2018-04-07 02:14:29,986 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1521, Invalid=5619, Unknown=0, NotChecked=0, Total=7140 [2018-04-07 02:14:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-07 02:14:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 197. [2018-04-07 02:14:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-07 02:14:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 208 transitions. [2018-04-07 02:14:29,993 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 208 transitions. Word has length 89 [2018-04-07 02:14:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:29,993 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 208 transitions. [2018-04-07 02:14:29,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-07 02:14:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 208 transitions. [2018-04-07 02:14:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-04-07 02:14:29,994 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:29,994 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:14:29,994 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:29,995 INFO L82 PathProgramCache]: Analyzing trace with hash 631796083, now seen corresponding path program 3 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-07 02:14:30,001 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:30,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 4 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:30,239 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 4 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:30,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:14:30,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-04-07 02:14:30,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-07 02:14:30,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-07 02:14:30,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2018-04-07 02:14:30,585 INFO L87 Difference]: Start difference. First operand 197 states and 208 transitions. Second operand 36 states. [2018-04-07 02:14:31,198 WARN L148 SmtUtils]: Spent 123ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-07 02:14:32,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:32,201 INFO L93 Difference]: Finished difference Result 384 states and 406 transitions. [2018-04-07 02:14:32,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-07 02:14:32,202 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 100 [2018-04-07 02:14:32,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:32,203 INFO L225 Difference]: With dead ends: 384 [2018-04-07 02:14:32,203 INFO L226 Difference]: Without dead ends: 197 [2018-04-07 02:14:32,205 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1660, Invalid=3596, Unknown=0, NotChecked=0, Total=5256 [2018-04-07 02:14:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-07 02:14:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-04-07 02:14:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-07 02:14:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 200 transitions. [2018-04-07 02:14:32,216 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 200 transitions. Word has length 100 [2018-04-07 02:14:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:32,216 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 200 transitions. [2018-04-07 02:14:32,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-07 02:14:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 200 transitions. [2018-04-07 02:14:32,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-04-07 02:14:32,218 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:32,218 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 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-07 02:14:32,219 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:32,219 INFO L82 PathProgramCache]: Analyzing trace with hash 6577975, now seen corresponding path program 4 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-07 02:14:32,227 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:32,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:32,715 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:33,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:14:33,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-04-07 02:14:33,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-07 02:14:33,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-07 02:14:33,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=3426, Unknown=0, NotChecked=0, Total=4032 [2018-04-07 02:14:33,896 INFO L87 Difference]: Start difference. First operand 197 states and 200 transitions. Second operand 64 states. [2018-04-07 02:14:36,163 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 124 DAG size of output 12 [2018-04-07 02:14:36,476 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 119 DAG size of output 11 [2018-04-07 02:14:36,720 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 116 DAG size of output 12 [2018-04-07 02:14:37,684 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 100 DAG size of output 12 [2018-04-07 02:14:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:41,007 INFO L93 Difference]: Finished difference Result 410 states and 444 transitions. [2018-04-07 02:14:41,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-07 02:14:41,007 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 160 [2018-04-07 02:14:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:41,010 INFO L225 Difference]: With dead ends: 410 [2018-04-07 02:14:41,010 INFO L226 Difference]: Without dead ends: 409 [2018-04-07 02:14:41,015 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3452 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=4624, Invalid=14282, Unknown=0, NotChecked=0, Total=18906 [2018-04-07 02:14:41,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-04-07 02:14:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 340. [2018-04-07 02:14:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-04-07 02:14:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 374 transitions. [2018-04-07 02:14:41,032 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 374 transitions. Word has length 160 [2018-04-07 02:14:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:41,032 INFO L459 AbstractCegarLoop]: Abstraction has 340 states and 374 transitions. [2018-04-07 02:14:41,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-07 02:14:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 374 transitions. [2018-04-07 02:14:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-04-07 02:14:41,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:41,034 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 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-07 02:14:41,035 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:41,035 INFO L82 PathProgramCache]: Analyzing trace with hash 203917458, now seen corresponding path program 4 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-07 02:14:41,052 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:41,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:41,119 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-07 02:14:41,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:14:41,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:14:41,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:14:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 1005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:41,963 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 1005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:43,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:14:43,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-04-07 02:14:43,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-07 02:14:43,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-07 02:14:43,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=688, Invalid=4424, Unknown=0, NotChecked=0, Total=5112 [2018-04-07 02:14:43,500 INFO L87 Difference]: Start difference. First operand 340 states and 374 transitions. Second operand 72 states. [2018-04-07 02:14:47,249 WARN L151 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 124 DAG size of output 27 [2018-04-07 02:14:47,729 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 120 DAG size of output 26 [2018-04-07 02:14:48,008 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 117 DAG size of output 27 [2018-04-07 02:14:48,558 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 113 DAG size of output 26 [2018-04-07 02:14:48,811 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 110 DAG size of output 27 [2018-04-07 02:14:49,207 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 106 DAG size of output 26 [2018-04-07 02:14:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:14:54,999 INFO L93 Difference]: Finished difference Result 390 states and 424 transitions. [2018-04-07 02:14:54,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-07 02:14:54,999 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 161 [2018-04-07 02:14:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:14:55,001 INFO L225 Difference]: With dead ends: 390 [2018-04-07 02:14:55,001 INFO L226 Difference]: Without dead ends: 389 [2018-04-07 02:14:55,005 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5988 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=5601, Invalid=21459, Unknown=0, NotChecked=0, Total=27060 [2018-04-07 02:14:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-04-07 02:14:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 341. [2018-04-07 02:14:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-04-07 02:14:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 360 transitions. [2018-04-07 02:14:55,019 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 360 transitions. Word has length 161 [2018-04-07 02:14:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:14:55,019 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 360 transitions. [2018-04-07 02:14:55,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-07 02:14:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 360 transitions. [2018-04-07 02:14:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-07 02:14:55,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:14:55,021 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:14:55,021 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:14:55,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1136103539, now seen corresponding path program 4 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-07 02:14:55,031 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:14:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:14:55,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:14:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 4 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:55,536 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:14:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 4 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:14:56,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:14:56,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2018-04-07 02:14:56,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-07 02:14:56,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-07 02:14:56,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=3364, Unknown=0, NotChecked=0, Total=4556 [2018-04-07 02:14:56,321 INFO L87 Difference]: Start difference. First operand 341 states and 360 transitions. Second operand 68 states. [2018-04-07 02:15:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:15:00,052 INFO L93 Difference]: Finished difference Result 672 states and 710 transitions. [2018-04-07 02:15:00,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-07 02:15:00,092 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 172 [2018-04-07 02:15:00,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:15:00,094 INFO L225 Difference]: With dead ends: 672 [2018-04-07 02:15:00,094 INFO L226 Difference]: Without dead ends: 341 [2018-04-07 02:15:00,097 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6512 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6516, Invalid=14364, Unknown=0, NotChecked=0, Total=20880 [2018-04-07 02:15:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-07 02:15:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-04-07 02:15:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-04-07 02:15:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 344 transitions. [2018-04-07 02:15:00,107 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 344 transitions. Word has length 172 [2018-04-07 02:15:00,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:15:00,108 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 344 transitions. [2018-04-07 02:15:00,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-07 02:15:00,108 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 344 transitions. [2018-04-07 02:15:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-04-07 02:15:00,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:15:00,111 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 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-07 02:15:00,111 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:15:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash 517643575, now seen corresponding path program 5 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-07 02:15:00,119 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:15:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:15:00,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:15:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:15:01,858 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:15:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:15:06,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:15:06,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 127 [2018-04-07 02:15:06,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-07 02:15:06,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-07 02:15:06,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=14979, Unknown=0, NotChecked=0, Total=16256 [2018-04-07 02:15:06,988 INFO L87 Difference]: Start difference. First operand 341 states and 344 transitions. Second operand 128 states. [2018-04-07 02:15:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:15:14,888 INFO L93 Difference]: Finished difference Result 359 states and 363 transitions. [2018-04-07 02:15:14,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-07 02:15:14,888 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 304 [2018-04-07 02:15:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:15:14,890 INFO L225 Difference]: With dead ends: 359 [2018-04-07 02:15:14,890 INFO L226 Difference]: Without dead ends: 358 [2018-04-07 02:15:14,892 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3844 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3540, Invalid=32370, Unknown=0, NotChecked=0, Total=35910 [2018-04-07 02:15:14,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-07 02:15:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 349. [2018-04-07 02:15:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-04-07 02:15:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 353 transitions. [2018-04-07 02:15:14,908 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 353 transitions. Word has length 304 [2018-04-07 02:15:14,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:15:14,908 INFO L459 AbstractCegarLoop]: Abstraction has 349 states and 353 transitions. [2018-04-07 02:15:14,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-07 02:15:14,909 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 353 transitions. [2018-04-07 02:15:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-04-07 02:15:14,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:15:14,911 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 31, 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-07 02:15:14,911 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:15:14,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1132918126, now seen corresponding path program 5 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-07 02:15:14,926 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:15:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:15:15,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:15:15,044 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-07 02:15:15,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:15:15,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:15:15,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:15:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4309 backedges. 0 proven. 4309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:15:18,249 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:15:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4309 backedges. 0 proven. 4309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:15:22,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:15:22,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 135 [2018-04-07 02:15:22,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-04-07 02:15:22,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-04-07 02:15:22,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1423, Invalid=16937, Unknown=0, NotChecked=0, Total=18360 [2018-04-07 02:15:22,683 INFO L87 Difference]: Start difference. First operand 349 states and 353 transitions. Second operand 136 states. [2018-04-07 02:15:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:15:36,167 INFO L93 Difference]: Finished difference Result 358 states and 362 transitions. [2018-04-07 02:15:36,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-07 02:15:36,167 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 305 [2018-04-07 02:15:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:15:36,170 INFO L225 Difference]: With dead ends: 358 [2018-04-07 02:15:36,170 INFO L226 Difference]: Without dead ends: 357 [2018-04-07 02:15:36,173 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11056 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=4956, Invalid=49100, Unknown=0, NotChecked=0, Total=54056 [2018-04-07 02:15:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-04-07 02:15:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 350. [2018-04-07 02:15:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-07 02:15:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 354 transitions. [2018-04-07 02:15:36,187 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 354 transitions. Word has length 305 [2018-04-07 02:15:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:15:36,188 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 354 transitions. [2018-04-07 02:15:36,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-04-07 02:15:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 354 transitions. [2018-04-07 02:15:36,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-04-07 02:15:36,190 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:15:36,190 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 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-07 02:15:36,190 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:15:36,191 INFO L82 PathProgramCache]: Analyzing trace with hash 920431173, now seen corresponding path program 6 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-07 02:15:36,201 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:15:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:15:36,282 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:15:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 4560 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:15:38,272 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:15:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 4560 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:15:41,306 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:15:41,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [69, 69] imperfect sequences [] total 134 [2018-04-07 02:15:41,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-04-07 02:15:41,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-04-07 02:15:41,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3467, Invalid=14355, Unknown=0, NotChecked=0, Total=17822 [2018-04-07 02:15:41,308 INFO L87 Difference]: Start difference. First operand 350 states and 354 transitions. Second operand 134 states. [2018-04-07 02:15:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:15:46,654 INFO L93 Difference]: Finished difference Result 683 states and 692 transitions. [2018-04-07 02:15:46,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-07 02:15:46,655 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 313 [2018-04-07 02:15:46,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:15:46,656 INFO L225 Difference]: With dead ends: 683 [2018-04-07 02:15:46,657 INFO L226 Difference]: Without dead ends: 349 [2018-04-07 02:15:46,661 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 491 SyntacticMatches, 2 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12977 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13102, Invalid=40954, Unknown=0, NotChecked=0, Total=54056 [2018-04-07 02:15:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-07 02:15:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2018-04-07 02:15:46,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-07 02:15:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 349 transitions. [2018-04-07 02:15:46,674 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 349 transitions. Word has length 313 [2018-04-07 02:15:46,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:15:46,675 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 349 transitions. [2018-04-07 02:15:46,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-04-07 02:15:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 349 transitions. [2018-04-07 02:15:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-04-07 02:15:46,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:15:46,677 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:15:46,677 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:15:46,677 INFO L82 PathProgramCache]: Analyzing trace with hash 482397811, now seen corresponding path program 5 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-07 02:15:46,685 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:15:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:15:46,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:15:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4251 backedges. 4 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:15:48,457 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:15:48,813 WARN L148 SmtUtils]: Spent 351ms on a formula simplification that was a NOOP. DAG size: 165 [2018-04-07 02:15:49,101 WARN L148 SmtUtils]: Spent 284ms on a formula simplification that was a NOOP. DAG size: 165 [2018-04-07 02:15:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4251 backedges. 4 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:15:50,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:15:50,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 131 [2018-04-07 02:15:50,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-07 02:15:50,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-07 02:15:50,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3396, Invalid=13634, Unknown=0, NotChecked=0, Total=17030 [2018-04-07 02:15:50,760 INFO L87 Difference]: Start difference. First operand 346 states and 349 transitions. Second operand 131 states. [2018-04-07 02:15:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:15:53,395 INFO L93 Difference]: Finished difference Result 679 states and 685 transitions. [2018-04-07 02:15:53,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-07 02:15:53,396 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 316 [2018-04-07 02:15:53,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:15:53,397 INFO L225 Difference]: With dead ends: 679 [2018-04-07 02:15:53,397 INFO L226 Difference]: Without dead ends: 346 [2018-04-07 02:15:53,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 500 SyntacticMatches, 2 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14761 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9634, Invalid=27808, Unknown=0, NotChecked=0, Total=37442 [2018-04-07 02:15:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-07 02:15:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-04-07 02:15:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-07 02:15:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 348 transitions. [2018-04-07 02:15:53,408 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 348 transitions. Word has length 316 [2018-04-07 02:15:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:15:53,408 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 348 transitions. [2018-04-07 02:15:53,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-07 02:15:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 348 transitions. [2018-04-07 02:15:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-04-07 02:15:53,410 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:15:53,410 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:15:53,410 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:15:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash -197020031, now seen corresponding path program 6 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-07 02:15:53,417 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:15:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:15:53,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:15:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4532 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-07 02:15:53,579 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:15:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4532 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-07 02:15:53,667 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:15:53,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-07 02:15:53,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-07 02:15:53,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-07 02:15:53,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-07 02:15:53,668 INFO L87 Difference]: Start difference. First operand 346 states and 348 transitions. Second operand 9 states. [2018-04-07 02:15:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:15:53,744 INFO L93 Difference]: Finished difference Result 362 states and 364 transitions. [2018-04-07 02:15:53,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-07 02:15:53,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 325 [2018-04-07 02:15:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:15:53,748 INFO L225 Difference]: With dead ends: 362 [2018-04-07 02:15:53,748 INFO L226 Difference]: Without dead ends: 361 [2018-04-07 02:15:53,748 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 641 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-04-07 02:15:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-04-07 02:15:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 343. [2018-04-07 02:15:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-07 02:15:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 345 transitions. [2018-04-07 02:15:53,758 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 345 transitions. Word has length 325 [2018-04-07 02:15:53,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:15:53,758 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 345 transitions. [2018-04-07 02:15:53,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-07 02:15:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 345 transitions. [2018-04-07 02:15:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-07 02:15:53,761 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:15:53,761 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 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] [2018-04-07 02:15:53,761 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:15:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash 312742184, 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-07 02:15:53,775 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:15:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:15:53,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:15:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-07 02:15:53,952 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:15:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-07 02:15:54,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:15:54,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-07 02:15:54,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-07 02:15:54,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-07 02:15:54,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-07 02:15:54,481 INFO L87 Difference]: Start difference. First operand 343 states and 345 transitions. Second operand 8 states. [2018-04-07 02:15:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:15:54,632 INFO L93 Difference]: Finished difference Result 395 states and 401 transitions. [2018-04-07 02:15:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-07 02:15:54,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 332 [2018-04-07 02:15:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:15:54,634 INFO L225 Difference]: With dead ends: 395 [2018-04-07 02:15:54,634 INFO L226 Difference]: Without dead ends: 375 [2018-04-07 02:15:54,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 657 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-07 02:15:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-04-07 02:15:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 365. [2018-04-07 02:15:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-07 02:15:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 369 transitions. [2018-04-07 02:15:54,646 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 369 transitions. Word has length 332 [2018-04-07 02:15:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:15:54,647 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 369 transitions. [2018-04-07 02:15:54,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-07 02:15:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 369 transitions. [2018-04-07 02:15:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2018-04-07 02:15:54,658 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:15:54,659 INFO L355 BasicCegarLoop]: trace histogram [99, 96, 96, 96, 96, 96, 96, 96, 96, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:15:54,659 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:15:54,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1041244760, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:15:54,665 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:15:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:15:54,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:15:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 41685 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 41646 trivial. 0 not checked. [2018-04-07 02:15:55,375 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:15:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 41685 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 41646 trivial. 0 not checked. [2018-04-07 02:15:55,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:15:55,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-07 02:15:55,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-07 02:15:55,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-07 02:15:55,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-04-07 02:15:55,769 INFO L87 Difference]: Start difference. First operand 365 states and 369 transitions. Second operand 16 states. [2018-04-07 02:15:56,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:15:56,091 INFO L93 Difference]: Finished difference Result 439 states and 451 transitions. [2018-04-07 02:15:56,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-07 02:15:56,091 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 950 [2018-04-07 02:15:56,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:15:56,094 INFO L225 Difference]: With dead ends: 439 [2018-04-07 02:15:56,094 INFO L226 Difference]: Without dead ends: 419 [2018-04-07 02:15:56,094 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1911 GetRequests, 1885 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=497, Unknown=0, NotChecked=0, Total=756 [2018-04-07 02:15:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-04-07 02:15:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 409. [2018-04-07 02:15:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-04-07 02:15:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 417 transitions. [2018-04-07 02:15:56,107 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 417 transitions. Word has length 950 [2018-04-07 02:15:56,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:15:56,108 INFO L459 AbstractCegarLoop]: Abstraction has 409 states and 417 transitions. [2018-04-07 02:15:56,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-07 02:15:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 417 transitions. [2018-04-07 02:15:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2187 [2018-04-07 02:15:56,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:15:56,132 INFO L355 BasicCegarLoop]: trace histogram [231, 224, 224, 224, 224, 224, 224, 224, 224, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:15:56,132 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:15:56,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1433179816, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:15:56,139 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:15:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:15:56,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:15:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 228375 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 228130 trivial. 0 not checked. [2018-04-07 02:15:58,715 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:16:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 228375 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 228130 trivial. 0 not checked. [2018-04-07 02:16:00,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:16:00,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-07 02:16:00,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-07 02:16:00,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-07 02:16:00,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2018-04-07 02:16:00,494 INFO L87 Difference]: Start difference. First operand 409 states and 417 transitions. Second operand 32 states. [2018-04-07 02:16:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:16:01,391 INFO L93 Difference]: Finished difference Result 527 states and 551 transitions. [2018-04-07 02:16:01,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-07 02:16:01,391 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 2186 [2018-04-07 02:16:01,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:16:01,397 INFO L225 Difference]: With dead ends: 527 [2018-04-07 02:16:01,397 INFO L226 Difference]: Without dead ends: 507 [2018-04-07 02:16:01,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4399 GetRequests, 4341 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1155, Invalid=2385, Unknown=0, NotChecked=0, Total=3540 [2018-04-07 02:16:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-04-07 02:16:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 497. [2018-04-07 02:16:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-07 02:16:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 513 transitions. [2018-04-07 02:16:01,425 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 513 transitions. Word has length 2186 [2018-04-07 02:16:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:16:01,427 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 513 transitions. [2018-04-07 02:16:01,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-07 02:16:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 513 transitions. [2018-04-07 02:16:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4659 [2018-04-07 02:16:01,582 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:16:01,584 INFO L355 BasicCegarLoop]: trace histogram [495, 480, 480, 480, 480, 480, 480, 480, 480, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:16:01,584 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:16:01,585 INFO L82 PathProgramCache]: Analyzing trace with hash 215648424, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:16:01,593 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:16:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:16:02,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:16:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1051275 backedges. 0 proven. 1185 refuted. 0 times theorem prover too weak. 1050090 trivial. 0 not checked. [2018-04-07 02:16:09,447 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:16:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1051275 backedges. 0 proven. 1185 refuted. 0 times theorem prover too weak. 1050090 trivial. 0 not checked. [2018-04-07 02:16:16,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:16:16,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-04-07 02:16:16,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-07 02:16:16,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-07 02:16:16,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2018-04-07 02:16:16,612 INFO L87 Difference]: Start difference. First operand 497 states and 513 transitions. Second operand 64 states. [2018-04-07 02:16:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:16:18,447 INFO L93 Difference]: Finished difference Result 703 states and 751 transitions. [2018-04-07 02:16:18,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-07 02:16:18,448 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 4658 [2018-04-07 02:16:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:16:18,455 INFO L225 Difference]: With dead ends: 703 [2018-04-07 02:16:18,455 INFO L226 Difference]: Without dead ends: 683 [2018-04-07 02:16:18,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9375 GetRequests, 9253 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3257 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4867, Invalid=10385, Unknown=0, NotChecked=0, Total=15252 [2018-04-07 02:16:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-04-07 02:16:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 673. [2018-04-07 02:16:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-04-07 02:16:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 705 transitions. [2018-04-07 02:16:18,485 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 705 transitions. Word has length 4658 [2018-04-07 02:16:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:16:18,488 INFO L459 AbstractCegarLoop]: Abstraction has 673 states and 705 transitions. [2018-04-07 02:16:18,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-07 02:16:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 705 transitions. [2018-04-07 02:16:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9603 [2018-04-07 02:16:18,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:16:18,916 INFO L355 BasicCegarLoop]: trace histogram [1023, 992, 992, 992, 992, 992, 992, 992, 992, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:16:18,917 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:16:18,918 INFO L82 PathProgramCache]: Analyzing trace with hash -729256792, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:16:18,924 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:16:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:16:20,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:16:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4495155 backedges. 0 proven. 5177 refuted. 0 times theorem prover too weak. 4489978 trivial. 0 not checked. [2018-04-07 02:16:48,358 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:17:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4495155 backedges. 0 proven. 5177 refuted. 0 times theorem prover too weak. 4489978 trivial. 0 not checked. [2018-04-07 02:17:16,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:17:16,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-04-07 02:17:16,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-07 02:17:16,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-07 02:17:16,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-04-07 02:17:16,611 INFO L87 Difference]: Start difference. First operand 673 states and 705 transitions. Second operand 65 states. [2018-04-07 02:17:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:17:18,490 INFO L93 Difference]: Finished difference Result 714 states and 748 transitions. [2018-04-07 02:17:18,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-07 02:17:18,494 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 9602 [2018-04-07 02:17:18,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:17:18,503 INFO L225 Difference]: With dead ends: 714 [2018-04-07 02:17:18,503 INFO L226 Difference]: Without dead ends: 694 [2018-04-07 02:17:18,505 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19265 GetRequests, 19077 SyntacticMatches, 63 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5673 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-04-07 02:17:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-04-07 02:17:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 684. [2018-04-07 02:17:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2018-04-07 02:17:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 717 transitions. [2018-04-07 02:17:18,544 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 717 transitions. Word has length 9602 [2018-04-07 02:17:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:17:18,550 INFO L459 AbstractCegarLoop]: Abstraction has 684 states and 717 transitions. [2018-04-07 02:17:18,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-07 02:17:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 717 transitions. [2018-04-07 02:17:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9912 [2018-04-07 02:17:19,022 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:17:19,025 INFO L355 BasicCegarLoop]: trace histogram [1056, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:17:19,025 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-07 02:17:19,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1007406076, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:17:19,032 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:17:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:17:21,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:17:22,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-07 02:17:22,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:22,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:22,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:17:23,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:23,123 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 12 treesize of output 15 [2018-04-07 02:17:23,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:23,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:23,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:23,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:23,296 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 12 treesize of output 15 [2018-04-07 02:17:23,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:23,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:23,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:23,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:23,512 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 12 treesize of output 15 [2018-04-07 02:17:23,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:23,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:23,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:23,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:23,747 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 12 treesize of output 15 [2018-04-07 02:17:23,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:23,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:23,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:23,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:23,888 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 12 treesize of output 15 [2018-04-07 02:17:23,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:23,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:23,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:24,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:24,028 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 12 treesize of output 15 [2018-04-07 02:17:24,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:24,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:24,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:24,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:24,215 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 12 treesize of output 15 [2018-04-07 02:17:24,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:24,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:24,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:24,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:24,471 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 12 treesize of output 15 [2018-04-07 02:17:24,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:24,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:24,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:24,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:24,676 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 12 treesize of output 15 [2018-04-07 02:17:24,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:24,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:24,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:24,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:24,826 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 12 treesize of output 15 [2018-04-07 02:17:24,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:24,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:24,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:24,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:24,969 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 12 treesize of output 15 [2018-04-07 02:17:24,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:24,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:24,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:25,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:25,116 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 12 treesize of output 15 [2018-04-07 02:17:25,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:25,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:25,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:25,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:25,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-07 02:17:25,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:25,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:25,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:25,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:25,414 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 12 treesize of output 15 [2018-04-07 02:17:25,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:25,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:25,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:25,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:25,682 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 12 treesize of output 15 [2018-04-07 02:17:25,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:25,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:25,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:25,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:25,868 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 12 treesize of output 15 [2018-04-07 02:17:25,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:25,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:25,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:26,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:26,023 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 12 treesize of output 15 [2018-04-07 02:17:26,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:26,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:26,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:26,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:26,177 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 12 treesize of output 15 [2018-04-07 02:17:26,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:26,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:26,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:26,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:26,332 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 12 treesize of output 15 [2018-04-07 02:17:26,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:26,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:26,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:26,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:26,487 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 12 treesize of output 15 [2018-04-07 02:17:26,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:26,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:26,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:26,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:26,737 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 12 treesize of output 15 [2018-04-07 02:17:26,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:26,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:26,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:26,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:26,952 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 12 treesize of output 15 [2018-04-07 02:17:26,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:26,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:26,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:27,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:27,138 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 12 treesize of output 15 [2018-04-07 02:17:27,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:27,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:27,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:27,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:27,325 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 12 treesize of output 15 [2018-04-07 02:17:27,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:27,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:27,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:27,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:27,515 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 12 treesize of output 15 [2018-04-07 02:17:27,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:27,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:27,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:27,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:27,732 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 12 treesize of output 15 [2018-04-07 02:17:27,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:27,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:27,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:28,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:28,009 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 12 treesize of output 15 [2018-04-07 02:17:28,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:28,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:28,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:28,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:28,217 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 12 treesize of output 15 [2018-04-07 02:17:28,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:28,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:28,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:28,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:28,425 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 12 treesize of output 15 [2018-04-07 02:17:28,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:28,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:28,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:28,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:28,615 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 12 treesize of output 15 [2018-04-07 02:17:28,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:28,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:28,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:17:28,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:17:28,836 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 12 treesize of output 15 [2018-04-07 02:17:28,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:17:28,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:17:28,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-07 02:18:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4790000 backedges. 5055 proven. 294812 refuted. 0 times theorem prover too weak. 4490133 trivial. 0 not checked. [2018-04-07 02:18:00,985 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:18:08,099 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-07 02:18:08,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:18:08,101 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-07 02:18:08,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-07 02:18:08,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-07 02:18:08,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-04-07 02:18:08,376 WARN L148 SmtUtils]: Spent 264ms on a formula simplification that was a NOOP. DAG size: 167 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown