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/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-07 02:10:04,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-07 02:10:04,608 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-07 02:10:04,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-07 02:10:04,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-07 02:10:04,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-07 02:10:04,625 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-07 02:10:04,627 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-07 02:10:04,629 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-07 02:10:04,630 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-07 02:10:04,631 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-07 02:10:04,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-07 02:10:04,632 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-07 02:10:04,633 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-07 02:10:04,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-07 02:10:04,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-07 02:10:04,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-07 02:10:04,640 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-07 02:10:04,642 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-07 02:10:04,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-07 02:10:04,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-07 02:10:04,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-07 02:10:04,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-07 02:10:04,647 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-07 02:10:04,648 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-07 02:10:04,651 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-07 02:10:04,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-07 02:10:04,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-07 02:10:04,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-07 02:10:04,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-07 02:10:04,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-07 02:10:04,655 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:10:04,688 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-07 02:10:04,688 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-07 02:10:04,688 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-07 02:10:04,689 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-07 02:10:04,689 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-07 02:10:04,690 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-07 02:10:04,690 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-07 02:10:04,690 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-07 02:10:04,690 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-07 02:10:04,690 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-07 02:10:04,691 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-07 02:10:04,691 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-07 02:10:04,691 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-07 02:10:04,692 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-07 02:10:04,692 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-07 02:10:04,692 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-07 02:10:04,692 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-07 02:10:04,692 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-07 02:10:04,693 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-07 02:10:04,693 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-07 02:10:04,693 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-07 02:10:04,693 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-07 02:10:04,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-07 02:10:04,695 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-07 02:10:04,695 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-07 02:10:04,696 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-07 02:10:04,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-07 02:10:04,696 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-07 02:10:04,696 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-07 02:10:04,697 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-07 02:10:04,697 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-07 02:10:04,697 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-07 02:10:04,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:10:04,697 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-07 02:10:04,698 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-07 02:10:04,698 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-07 02:10:04,699 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-07 02:10:04,700 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-07 02:10:04,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-07 02:10:04,745 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-07 02:10:04,749 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-07 02:10:04,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-07 02:10:04,754 INFO L276 PluginConnector]: CDTParser initialized [2018-04-07 02:10:04,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-04-07 02:10:05,110 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1f9a34e29 [2018-04-07 02:10:05,244 INFO L287 CDTParser]: IsIndexed: true [2018-04-07 02:10:05,245 INFO L288 CDTParser]: Found 1 translation units. [2018-04-07 02:10:05,245 INFO L168 CDTParser]: Scanning ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-04-07 02:10:05,246 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-07 02:10:05,246 INFO L215 ultiparseSymbolTable]: [2018-04-07 02:10:05,246 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-07 02:10:05,246 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo ('foo') in ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-04-07 02:10:05,246 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-04-07 02:10:05,246 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-07 02:10:05,246 INFO L233 ultiparseSymbolTable]: [2018-04-07 02:10:05,263 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1f9a34e29 [2018-04-07 02:10:05,268 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-07 02:10:05,270 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-04-07 02:10:05,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-07 02:10:05,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-07 02:10:05,280 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-07 02:10:05,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:10:05" (1/1) ... [2018-04-07 02:10:05,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c95e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:10:05, skipping insertion in model container [2018-04-07 02:10:05,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:10:05" (1/1) ... [2018-04-07 02:10:05,305 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-07 02:10:05,317 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-07 02:10:05,453 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-07 02:10:05,479 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-07 02:10:05,485 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-07 02:10:05,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:10:05 WrapperNode [2018-04-07 02:10:05,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-07 02:10:05,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-07 02:10:05,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-07 02:10:05,495 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-07 02:10:05,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:10:05" (1/1) ... [2018-04-07 02:10:05,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:10:05" (1/1) ... [2018-04-07 02:10:05,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:10:05" (1/1) ... [2018-04-07 02:10:05,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:10:05" (1/1) ... [2018-04-07 02:10:05,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:10:05" (1/1) ... [2018-04-07 02:10:05,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:10:05" (1/1) ... [2018-04-07 02:10:05,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:10:05" (1/1) ... [2018-04-07 02:10:05,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-07 02:10:05,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-07 02:10:05,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-07 02:10:05,540 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-07 02:10:05,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:10:05" (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:10:05,605 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-07 02:10:05,605 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-07 02:10:05,606 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-04-07 02:10:05,606 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-07 02:10:05,606 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-04-07 02:10:05,606 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-07 02:10:05,606 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-07 02:10:05,606 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-07 02:10:05,606 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-07 02:10:05,606 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-07 02:10:05,606 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-07 02:10:05,607 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-07 02:10:05,607 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-07 02:10:05,914 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-07 02:10:05,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:10:05 BoogieIcfgContainer [2018-04-07 02:10:05,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-07 02:10:05,915 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-04-07 02:10:05,915 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-04-07 02:10:05,916 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-04-07 02:10:05,918 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:10:05" (1/1) ... [2018-04-07 02:10:05,927 INFO L139 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-04-07 02:10:05,927 INFO L140 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-04-07 02:10:05,946 INFO L299 apSepIcfgTransformer]: Heap separator: starting memloc-array-style preprocessing [2018-04-07 02:10:05,962 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-07 02:10:05,963 INFO L332 apSepIcfgTransformer]: finished MemlocArrayUpdater, created 0 location literals (each corresponds to one heap write) [2018-04-07 02:10:05,971 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-07 02:10:05,975 INFO L412 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-04-07 02:10:05,975 DEBUG L416 apSepIcfgTransformer]: storeIndexInfoToLocLiteral: Map: [2018-04-07 02:10:05,977 DEBUG L418 apSepIcfgTransformer]: edgeToIndexToStoreIndexInfo: NestedMap2: [2018-04-07 02:10:06,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-04-07 02:10:09,059 INFO L314 AbstractInterpreter]: Visited 69 different actions 192 times. Merged at 46 different actions 84 times. Never widened. Found 11 fixpoints after 6 different actions. Largest state had 21 variables. [2018-04-07 02:10:09,062 INFO L424 apSepIcfgTransformer]: finished equality analysis [2018-04-07 02:10:09,072 INFO L195 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-04-07 02:10:09,072 INFO L434 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-04-07 02:10:09,073 INFO L435 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-04-07 02:10:09,073 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:10:09,077 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_30 [2018-04-07 02:10:09,078 DEBUG L374 HeapPartitionManager]: with contents [NoStoreIndexInfo] [2018-04-07 02:10:09,078 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_30 [2018-04-07 02:10:09,078 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:10:09,078 DEBUG L325 HeapPartitionManager]: write locations: [NoStoreIndexInfo] [2018-04-07 02:10:09,079 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_30 [2018-04-07 02:10:09,079 DEBUG L374 HeapPartitionManager]: with contents [NoStoreIndexInfo] [2018-04-07 02:10:09,079 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_30 [2018-04-07 02:10:09,079 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:10:09,079 DEBUG L325 HeapPartitionManager]: write locations: [NoStoreIndexInfo] [2018-04-07 02:10:09,080 INFO L330 HeapPartitionManager]: partitioning result: [2018-04-07 02:10:09,080 INFO L335 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-04-07 02:10:09,080 INFO L344 HeapPartitionManager]: at dimension 0 [2018-04-07 02:10:09,080 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-04-07 02:10:09,081 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-07 02:10:09,081 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-07 02:10:09,081 DEBUG L356 HeapPartitionManager]: [NoStoreIndexInfo] [2018-04-07 02:10:09,081 INFO L344 HeapPartitionManager]: at dimension 1 [2018-04-07 02:10:09,081 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-04-07 02:10:09,081 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-07 02:10:09,081 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-07 02:10:09,082 DEBUG L356 HeapPartitionManager]: [NoStoreIndexInfo] [2018-04-07 02:10:09,083 INFO L131 ransitionTransformer]: executing heap partitioning transformation [2018-04-07 02:10:09,085 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,086 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,086 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,086 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,086 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,087 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,087 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,087 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,087 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,087 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:10:09,088 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,090 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,090 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,091 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,091 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,091 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,091 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,091 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~i~1=v_main_~i~1_8} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:10:09,092 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,092 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,092 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,092 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:10:09,092 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,093 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,093 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,093 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[main_~b~0] [2018-04-07 02:10:09,093 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,093 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,094 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,094 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,094 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,094 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,094 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,094 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~buffer~0=v_main_~buffer~0_1} AuxVars[] AssignedVars[main_~buffer~0] [2018-04-07 02:10:09,094 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,095 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,095 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,095 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:10:09,095 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,095 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,096 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,096 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_9 0) InVars {} OutVars{main_~i~1=v_main_~i~1_9} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:10:09,096 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,096 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,096 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,097 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,097 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,097 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,097 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,097 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,098 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,098 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,098 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,098 DEBUG L281 ransitionTransformer]: Formula: (not (< v_main_~i~1_10 32)) InVars {main_~i~1=v_main_~i~1_10} OutVars{main_~i~1=v_main_~i~1_10} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,098 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,098 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,099 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,099 DEBUG L281 ransitionTransformer]: Formula: (< 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:10:09,099 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,099 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,099 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,099 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_16 0) InVars {} OutVars{main_~i~1=v_main_~i~1_16} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:10:09,100 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,100 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,100 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,100 DEBUG L281 ransitionTransformer]: Formula: (or (not (< v_main_~i~1_12 100)) (not (<= 0 v_main_~i~1_12))) InVars {main_~i~1=v_main_~i~1_12} OutVars{main_~i~1=v_main_~i~1_12} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,101 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,101 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,101 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,101 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,101 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,101 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,102 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,102 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,102 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,102 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,102 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,103 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,103 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,103 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,103 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,104 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.baseInParam_1| |v_main_~#mask~0.base_7|) (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offsetInParam_1| |v_main_~#mask~0.offset_7|)) InVars {main_~#mask~0.base=|v_main_~#mask~0.base_7|, main_~#mask~0.offset=|v_main_~#mask~0.offset_7|} 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:10:09,104 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,104 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,104 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,104 DEBUG L281 ransitionTransformer]: Formula: (not (< v_main_~i~1_1 32)) InVars {main_~i~1=v_main_~i~1_1} OutVars{main_~i~1=v_main_~i~1_1} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,105 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,105 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,105 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,105 DEBUG L281 ransitionTransformer]: Formula: (< 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:10:09,105 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,105 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,105 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,106 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:10:09,106 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,106 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,106 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,106 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:10:09,106 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,106 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,107 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,107 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:10:09,107 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,107 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,108 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,108 DEBUG L281 ransitionTransformer]: Formula: (or (not (<= 0 v_main_~i~1_3)) (not (< v_main_~i~1_3 100))) InVars {main_~i~1=v_main_~i~1_3} OutVars{main_~i~1=v_main_~i~1_3} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,108 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,108 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,108 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,108 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,109 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,109 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,109 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,109 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:10:09,109 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,110 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,110 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,110 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~b~0_4 (store v_main_~b~0_5 v_main_~i~1_13 |v_main_#t~ret3_3|)) InVars {main_~i~1=v_main_~i~1_13, main_~b~0=v_main_~b~0_5, main_#t~ret3=|v_main_#t~ret3_3|} OutVars{main_~i~1=v_main_~i~1_13, 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:10:09,110 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,110 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,111 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,111 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:10:09,111 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,111 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,111 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,112 DEBUG L281 ransitionTransformer]: Formula: (not (= 32 (select v_main_~b~0_1 v_main_~i~1_4))) InVars {main_~b~0=v_main_~b~0_1, main_~i~1=v_main_~i~1_4} OutVars{main_~b~0=v_main_~b~0_1, main_~i~1=v_main_~i~1_4} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,112 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,112 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,112 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,112 DEBUG L281 ransitionTransformer]: Formula: (= (select v_main_~b~0_2 v_main_~i~1_5) 32) InVars {main_~b~0=v_main_~b~0_2, main_~i~1=v_main_~i~1_5} OutVars{main_~b~0=v_main_~b~0_2, main_~i~1=v_main_~i~1_5} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,112 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,112 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,113 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,113 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:10:09,113 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,113 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,113 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,113 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~ret3=|v_main_#t~ret3_4|} AuxVars[] AssignedVars[main_#t~ret3] [2018-04-07 02:10:09,113 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,113 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,114 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,114 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:10:09,114 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,114 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,114 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,114 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:10:09,115 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,115 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,115 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,115 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#t~post4_1| v_main_~i~1_6) InVars {main_~i~1=v_main_~i~1_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~1=v_main_~i~1_6} AuxVars[] AssignedVars[main_#t~post4] [2018-04-07 02:10:09,115 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,116 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,116 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,116 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:10:09,116 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,116 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,117 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,117 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:10:09,117 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,117 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,117 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,118 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#t~post2_1| v_main_~i~1_14) InVars {main_~i~1=v_main_~i~1_14} OutVars{main_~i~1=v_main_~i~1_14, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2] [2018-04-07 02:10:09,118 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,118 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,118 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,118 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:10:09,118 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,118 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,118 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,119 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:10:09,119 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,119 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,119 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,120 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_7 (+ |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_7} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:10:09,120 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,120 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,120 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,120 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_15 (+ |v_main_#t~post2_2| 1)) InVars {main_#t~post2=|v_main_#t~post2_2|} OutVars{main_~i~1=v_main_~i~1_15, main_#t~post2=|v_main_#t~post2_2|} AuxVars[] AssignedVars[main_~i~1] [2018-04-07 02:10:09,121 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,121 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,121 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,121 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:10:09,121 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,121 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,121 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,122 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:10:09,122 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,122 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,122 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,122 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~post4=|v_main_#t~post4_3|} AuxVars[] AssignedVars[main_#t~post4] [2018-04-07 02:10:09,122 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,122 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,122 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,122 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~post2=|v_main_#t~post2_3|} AuxVars[] AssignedVars[main_#t~post2] [2018-04-07 02:10:09,123 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,123 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,123 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,123 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,124 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,124 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,124 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,124 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,124 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,124 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,125 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,125 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:10:09,125 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,125 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,125 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,126 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:10:09,126 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,126 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,126 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,126 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:10:09,127 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,127 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,127 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,127 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:10:09,127 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,127 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,128 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,128 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,128 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,128 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,128 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,129 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,129 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,129 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,132 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,132 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:10:09,132 DEBUG L288 ransitionTransformer]: formula has changed [2018-04-07 02:10:09,132 DEBUG L289 ransitionTransformer]: old formula: [2018-04-07 02:10:09,132 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:10:09,133 DEBUG L291 ransitionTransformer]: new formula: [2018-04-07 02:10:09,133 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:10:09,133 DEBUG L296 ransitionTransformer]: invars have changed [2018-04-07 02:10:09,133 DEBUG L297 ransitionTransformer]: old invars: [2018-04-07 02:10:09,133 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:10:09,133 DEBUG L299 ransitionTransformer]: new invars: [2018-04-07 02:10:09,133 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:10:09,133 DEBUG L304 ransitionTransformer]: outvars have changed [2018-04-07 02:10:09,134 DEBUG L305 ransitionTransformer]: old outvars: [2018-04-07 02:10:09,134 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:10:09,134 DEBUG L307 ransitionTransformer]: new outvars: [2018-04-07 02:10:09,134 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:10:09,134 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,134 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,135 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:10:09,135 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,135 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,135 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,135 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:10:09,135 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,136 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,136 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,136 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:10:09,136 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,136 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,137 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,137 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:10:09,137 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,137 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,137 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,137 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:10:09,138 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,138 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,138 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,138 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:10:09,138 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,138 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,141 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,141 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:10:09,141 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,141 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,141 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,141 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:10:09,142 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,142 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,142 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,142 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:10:09,142 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,142 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,143 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:10:09,143 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:10:09,143 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:10:09,143 DEBUG L310 ransitionTransformer]: [2018-04-07 02:10:09,143 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-07 02:10:09,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 02:10:09 BasicIcfg [2018-04-07 02:10:09,145 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-04-07 02:10:09,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-07 02:10:09,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-07 02:10:09,150 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-07 02:10:09,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 02:10:05" (1/4) ... [2018-04-07 02:10:09,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64097a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:10:09, skipping insertion in model container [2018-04-07 02:10:09,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:10:05" (2/4) ... [2018-04-07 02:10:09,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64097a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:10:09, skipping insertion in model container [2018-04-07 02:10:09,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:10:05" (3/4) ... [2018-04-07 02:10:09,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64097a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 02:10:09, skipping insertion in model container [2018-04-07 02:10:09,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 02:10:09" (4/4) ... [2018-04-07 02:10:09,154 INFO L107 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-04-07 02:10:09,164 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-07 02:10:09,173 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-07 02:10:09,206 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-07 02:10:09,207 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-07 02:10:09,207 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-07 02:10:09,208 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-07 02:10:09,208 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-07 02:10:09,208 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-07 02:10:09,208 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-07 02:10:09,208 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-07 02:10:09,208 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-07 02:10:09,209 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-07 02:10:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-04-07 02:10:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-07 02:10:09,230 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:09,230 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:10:09,231 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:10:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash 840184683, 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:10:09,252 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:09,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:09,357 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:10:09,357 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:09,416 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:10:09,442 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:10:09,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-04-07 02:10:09,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-07 02:10:09,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-07 02:10:09,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-07 02:10:09,457 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-04-07 02:10:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:09,601 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2018-04-07 02:10:09,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-07 02:10:09,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-07 02:10:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:09,614 INFO L225 Difference]: With dead ends: 137 [2018-04-07 02:10:09,614 INFO L226 Difference]: Without dead ends: 81 [2018-04-07 02:10:09,618 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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:10:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-07 02:10:09,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2018-04-07 02:10:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-07 02:10:09,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-04-07 02:10:09,661 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 14 [2018-04-07 02:10:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:09,661 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-04-07 02:10:09,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-07 02:10:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-04-07 02:10:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-07 02:10:09,662 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:09,662 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] [2018-04-07 02:10:09,663 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:10:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash -247761374, 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:10:09,673 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:09,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:09,701 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:10:09,701 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:09,742 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:10:09,776 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:10:09,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2018-04-07 02:10:09,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-07 02:10:09,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-07 02:10:09,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-07 02:10:09,778 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 4 states. [2018-04-07 02:10:09,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:09,838 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-04-07 02:10:09,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-07 02:10:09,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-07 02:10:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:09,844 INFO L225 Difference]: With dead ends: 79 [2018-04-07 02:10:09,844 INFO L226 Difference]: Without dead ends: 78 [2018-04-07 02:10:09,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 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:10:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-07 02:10:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2018-04-07 02:10:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-07 02:10:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-07 02:10:09,856 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2018-04-07 02:10:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:09,857 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-07 02:10:09,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-07 02:10:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-07 02:10:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-07 02:10:09,858 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:09,858 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] [2018-04-07 02:10:09,858 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:10:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash 909332224, 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:10:09,869 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:09,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:09,928 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:10:09,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:10:09,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:10:09,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-07 02:10:09,962 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:10:09,963 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:09,970 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:10:10,003 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:10:10,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-07 02:10:10,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-07 02:10:10,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-07 02:10:10,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-07 02:10:10,004 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2018-04-07 02:10:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:10,087 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-04-07 02:10:10,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-07 02:10:10,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-04-07 02:10:10,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:10,089 INFO L225 Difference]: With dead ends: 68 [2018-04-07 02:10:10,089 INFO L226 Difference]: Without dead ends: 67 [2018-04-07 02:10:10,089 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-07 02:10:10,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-07 02:10:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-04-07 02:10:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-07 02:10:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-04-07 02:10:10,096 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 24 [2018-04-07 02:10:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:10,096 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-04-07 02:10:10,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-07 02:10:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-04-07 02:10:10,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-07 02:10:10,097 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:10,097 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] [2018-04-07 02:10:10,098 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:10:10,098 INFO L82 PathProgramCache]: Analyzing trace with hash 909332225, 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:10:10,112 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:10,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:10,139 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:10:10,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:10:10,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:10:10,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:10:10,257 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:10:10,257 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:10,462 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:10:10,497 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:10:10,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-07 02:10:10,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-07 02:10:10,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-07 02:10:10,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-07 02:10:10,498 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 10 states. [2018-04-07 02:10:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:10,944 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-04-07 02:10:10,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-07 02:10:10,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-04-07 02:10:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:10,946 INFO L225 Difference]: With dead ends: 76 [2018-04-07 02:10:10,946 INFO L226 Difference]: Without dead ends: 75 [2018-04-07 02:10:10,947 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-04-07 02:10:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-07 02:10:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2018-04-07 02:10:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-07 02:10:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-07 02:10:10,961 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 24 [2018-04-07 02:10:10,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:10,961 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-07 02:10:10,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-07 02:10:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-07 02:10:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-07 02:10:10,965 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:10,965 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] [2018-04-07 02:10:10,965 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:10:10,965 INFO L82 PathProgramCache]: Analyzing trace with hash 377367732, 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:10:10,980 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:11,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:11,086 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:10:11,086 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:11,139 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:10:11,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:10:11,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-04-07 02:10:11,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-07 02:10:11,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-07 02:10:11,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-07 02:10:11,177 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 8 states. [2018-04-07 02:10:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:11,473 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-04-07 02:10:11,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-07 02:10:11,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-07 02:10:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:11,475 INFO L225 Difference]: With dead ends: 102 [2018-04-07 02:10:11,475 INFO L226 Difference]: Without dead ends: 101 [2018-04-07 02:10:11,476 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-07 02:10:11,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-07 02:10:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2018-04-07 02:10:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-07 02:10:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-04-07 02:10:11,482 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 32 [2018-04-07 02:10:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:11,482 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-04-07 02:10:11,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-07 02:10:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-04-07 02:10:11,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-07 02:10:11,484 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:11,484 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] [2018-04-07 02:10:11,484 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:10:11,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1186501969, 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:10:11,490 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:11,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:11,514 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:10:11,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:10:11,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:10:11,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:10:11,656 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:10:11,656 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:11,834 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:10:11,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:10:11,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-04-07 02:10:11,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-07 02:10:11,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-07 02:10:11,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-07 02:10:11,856 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 14 states. [2018-04-07 02:10:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:12,100 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-04-07 02:10:12,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-07 02:10:12,100 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-04-07 02:10:12,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:12,102 INFO L225 Difference]: With dead ends: 96 [2018-04-07 02:10:12,102 INFO L226 Difference]: Without dead ends: 95 [2018-04-07 02:10:12,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-04-07 02:10:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-07 02:10:12,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2018-04-07 02:10:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-07 02:10:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-04-07 02:10:12,110 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 33 [2018-04-07 02:10:12,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:12,111 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-04-07 02:10:12,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-07 02:10:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-04-07 02:10:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-07 02:10:12,112 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:12,112 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:10:12,112 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:10:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1851771686, 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:10:12,127 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:12,141 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:10:12,169 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:10:12,223 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:10:12,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-07 02:10:12,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-07 02:10:12,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-07 02:10:12,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-07 02:10:12,224 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 8 states. [2018-04-07 02:10:12,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:12,270 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-04-07 02:10:12,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-07 02:10:12,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-04-07 02:10:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:12,271 INFO L225 Difference]: With dead ends: 161 [2018-04-07 02:10:12,271 INFO L226 Difference]: Without dead ends: 86 [2018-04-07 02:10:12,272 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 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:10:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-07 02:10:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-07 02:10:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-07 02:10:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-04-07 02:10:12,280 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 34 [2018-04-07 02:10:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:12,281 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-04-07 02:10:12,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-07 02:10:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-04-07 02:10:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-07 02:10:12,283 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:12,283 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:10:12,283 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:10:12,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1644163320, 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:10:12,292 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:12,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:10:12,361 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:10:12,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:10:12,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-04-07 02:10:12,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-07 02:10:12,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-07 02:10:12,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-04-07 02:10:12,500 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 12 states. [2018-04-07 02:10:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:12,691 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2018-04-07 02:10:12,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-07 02:10:12,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-04-07 02:10:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:12,706 INFO L225 Difference]: With dead ends: 164 [2018-04-07 02:10:12,706 INFO L226 Difference]: Without dead ends: 86 [2018-04-07 02:10:12,707 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2018-04-07 02:10:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-07 02:10:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-07 02:10:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-07 02:10:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-04-07 02:10:12,715 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 43 [2018-04-07 02:10:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:12,715 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-04-07 02:10:12,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-07 02:10:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-04-07 02:10:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-07 02:10:12,716 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:12,716 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] [2018-04-07 02:10:12,716 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:10:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash -919097228, 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:10:12,722 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:12,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:12,786 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:10:12,787 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:12,874 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:10:12,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:10:12,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-04-07 02:10:12,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-07 02:10:12,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-07 02:10:12,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-07 02:10:12,897 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 16 states. [2018-04-07 02:10:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:13,226 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-04-07 02:10:13,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-07 02:10:13,227 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-07 02:10:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:13,228 INFO L225 Difference]: With dead ends: 143 [2018-04-07 02:10:13,228 INFO L226 Difference]: Without dead ends: 142 [2018-04-07 02:10:13,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2018-04-07 02:10:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-07 02:10:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 121. [2018-04-07 02:10:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-07 02:10:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-04-07 02:10:13,237 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 50 [2018-04-07 02:10:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:13,237 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-04-07 02:10:13,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-07 02:10:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-04-07 02:10:13,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-07 02:10:13,239 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:13,239 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] [2018-04-07 02:10:13,239 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:10:13,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1572757231, 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:10:13,245 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:13,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:13,264 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:10:13,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:10:13,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:10:13,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:10:13,348 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:10:13,348 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:13,513 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:10:13,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:10:13,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-04-07 02:10:13,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-07 02:10:13,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-07 02:10:13,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-04-07 02:10:13,536 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 22 states. [2018-04-07 02:10:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:14,381 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-04-07 02:10:14,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-07 02:10:14,381 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-04-07 02:10:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:14,382 INFO L225 Difference]: With dead ends: 135 [2018-04-07 02:10:14,382 INFO L226 Difference]: Without dead ends: 134 [2018-04-07 02:10:14,383 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=430, Invalid=1292, Unknown=0, NotChecked=0, Total=1722 [2018-04-07 02:10:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-07 02:10:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2018-04-07 02:10:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-07 02:10:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-04-07 02:10:14,390 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 51 [2018-04-07 02:10:14,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:14,390 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-04-07 02:10:14,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-07 02:10:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-04-07 02:10:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-07 02:10:14,391 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:14,391 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:10:14,391 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:10:14,392 INFO L82 PathProgramCache]: Analyzing trace with hash -628968632, 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:10:14,399 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:14,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:14,493 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:10:14,493 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:10:14,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:10:14,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-07 02:10:14,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-07 02:10:14,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-07 02:10:14,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-04-07 02:10:14,671 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 20 states. [2018-04-07 02:10:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:15,043 INFO L93 Difference]: Finished difference Result 236 states and 250 transitions. [2018-04-07 02:10:15,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-07 02:10:15,043 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-04-07 02:10:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:15,044 INFO L225 Difference]: With dead ends: 236 [2018-04-07 02:10:15,044 INFO L226 Difference]: Without dead ends: 122 [2018-04-07 02:10:15,045 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 102 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:10:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-07 02:10:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-04-07 02:10:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-07 02:10:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2018-04-07 02:10:15,051 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 61 [2018-04-07 02:10:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:15,052 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2018-04-07 02:10:15,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-07 02:10:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2018-04-07 02:10:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-07 02:10:15,054 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:15,054 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] [2018-04-07 02:10:15,054 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:10:15,054 INFO L82 PathProgramCache]: Analyzing trace with hash 953313268, 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:10:15,073 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:15,098 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:15,235 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:10:15,235 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:15,527 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:10:15,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:10:15,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-04-07 02:10:15,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-07 02:10:15,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-07 02:10:15,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2018-04-07 02:10:15,552 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand 32 states. [2018-04-07 02:10:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:16,812 INFO L93 Difference]: Finished difference Result 231 states and 249 transitions. [2018-04-07 02:10:16,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-07 02:10:16,813 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 86 [2018-04-07 02:10:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:16,814 INFO L225 Difference]: With dead ends: 231 [2018-04-07 02:10:16,814 INFO L226 Difference]: Without dead ends: 230 [2018-04-07 02:10:16,815 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1096, Invalid=3194, Unknown=0, NotChecked=0, Total=4290 [2018-04-07 02:10:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-07 02:10:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 193. [2018-04-07 02:10:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-07 02:10:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 211 transitions. [2018-04-07 02:10:16,824 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 211 transitions. Word has length 86 [2018-04-07 02:10:16,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:16,824 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 211 transitions. [2018-04-07 02:10:16,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-07 02:10:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 211 transitions. [2018-04-07 02:10:16,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-07 02:10:16,825 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:16,825 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] [2018-04-07 02:10:16,825 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:10:16,825 INFO L82 PathProgramCache]: Analyzing trace with hash -512059537, 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:10:16,833 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:16,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:16,858 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:10:16,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:10:16,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:10:16,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:10:17,110 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:10:17,111 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:17,477 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:10:17,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:10:17,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-04-07 02:10:17,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-07 02:10:17,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-07 02:10:17,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2018-04-07 02:10:17,500 INFO L87 Difference]: Start difference. First operand 193 states and 211 transitions. Second operand 38 states. [2018-04-07 02:10:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:19,994 INFO L93 Difference]: Finished difference Result 219 states and 237 transitions. [2018-04-07 02:10:19,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-07 02:10:19,995 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 87 [2018-04-07 02:10:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:19,996 INFO L225 Difference]: With dead ends: 219 [2018-04-07 02:10:19,996 INFO L226 Difference]: Without dead ends: 218 [2018-04-07 02:10:19,998 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1510, Invalid=5132, Unknown=0, NotChecked=0, Total=6642 [2018-04-07 02:10:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-07 02:10:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 194. [2018-04-07 02:10:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-07 02:10:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 205 transitions. [2018-04-07 02:10:20,009 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 205 transitions. Word has length 87 [2018-04-07 02:10:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:20,009 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 205 transitions. [2018-04-07 02:10:20,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-07 02:10:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2018-04-07 02:10:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-07 02:10:20,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:20,011 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 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:10:20,011 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:10:20,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1555188680, 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:10:20,020 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:20,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:10:20,207 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:10:20,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:10:20,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-04-07 02:10:20,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-07 02:10:20,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-07 02:10:20,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2018-04-07 02:10:20,541 INFO L87 Difference]: Start difference. First operand 194 states and 205 transitions. Second operand 36 states. [2018-04-07 02:10:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:21,789 INFO L93 Difference]: Finished difference Result 380 states and 402 transitions. [2018-04-07 02:10:21,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-07 02:10:21,790 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 97 [2018-04-07 02:10:21,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:21,791 INFO L225 Difference]: With dead ends: 380 [2018-04-07 02:10:21,791 INFO L226 Difference]: Without dead ends: 194 [2018-04-07 02:10:21,794 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1660, Invalid=3596, Unknown=0, NotChecked=0, Total=5256 [2018-04-07 02:10:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-07 02:10:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-04-07 02:10:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-07 02:10:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 197 transitions. [2018-04-07 02:10:21,800 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 197 transitions. Word has length 97 [2018-04-07 02:10:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:21,801 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 197 transitions. [2018-04-07 02:10:21,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-07 02:10:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 197 transitions. [2018-04-07 02:10:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-04-07 02:10:21,808 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:21,808 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] [2018-04-07 02:10:21,808 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:10:21,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1657366796, 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:10:21,814 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:21,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:22,201 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:10:22,201 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:23,263 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:10:23,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:10:23,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-04-07 02:10:23,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-07 02:10:23,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-07 02:10:23,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=3426, Unknown=0, NotChecked=0, Total=4032 [2018-04-07 02:10:23,287 INFO L87 Difference]: Start difference. First operand 194 states and 197 transitions. Second operand 64 states. [2018-04-07 02:10:25,301 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 119 DAG size of output 11 [2018-04-07 02:10:25,970 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 108 DAG size of output 12 [2018-04-07 02:10:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:29,371 INFO L93 Difference]: Finished difference Result 407 states and 441 transitions. [2018-04-07 02:10:29,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-07 02:10:29,371 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 158 [2018-04-07 02:10:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:29,374 INFO L225 Difference]: With dead ends: 407 [2018-04-07 02:10:29,375 INFO L226 Difference]: Without dead ends: 406 [2018-04-07 02:10:29,379 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3452 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4624, Invalid=14282, Unknown=0, NotChecked=0, Total=18906 [2018-04-07 02:10:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-04-07 02:10:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 337. [2018-04-07 02:10:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-04-07 02:10:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 371 transitions. [2018-04-07 02:10:29,391 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 371 transitions. Word has length 158 [2018-04-07 02:10:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:29,392 INFO L459 AbstractCegarLoop]: Abstraction has 337 states and 371 transitions. [2018-04-07 02:10:29,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-07 02:10:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 371 transitions. [2018-04-07 02:10:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-04-07 02:10:29,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:29,393 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] [2018-04-07 02:10:29,393 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:10:29,393 INFO L82 PathProgramCache]: Analyzing trace with hash 161237103, 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:10:29,402 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:29,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:29,443 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:10:29,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:10:29,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:10:29,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:10:30,082 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:10:30,083 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:31,133 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:10:31,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:10:31,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-04-07 02:10:31,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-07 02:10:31,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-07 02:10:31,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=4147, Unknown=0, NotChecked=0, Total=4830 [2018-04-07 02:10:31,156 INFO L87 Difference]: Start difference. First operand 337 states and 371 transitions. Second operand 70 states. [2018-04-07 02:10:34,055 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 124 DAG size of output 27 [2018-04-07 02:10:34,453 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 120 DAG size of output 26 [2018-04-07 02:10:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:40,297 INFO L93 Difference]: Finished difference Result 387 states and 421 transitions. [2018-04-07 02:10:40,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-07 02:10:40,297 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 159 [2018-04-07 02:10:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:40,299 INFO L225 Difference]: With dead ends: 387 [2018-04-07 02:10:40,299 INFO L226 Difference]: Without dead ends: 386 [2018-04-07 02:10:40,305 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5800 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=5590, Invalid=20492, Unknown=0, NotChecked=0, Total=26082 [2018-04-07 02:10:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-04-07 02:10:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 338. [2018-04-07 02:10:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-07 02:10:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 357 transitions. [2018-04-07 02:10:40,322 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 357 transitions. Word has length 159 [2018-04-07 02:10:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:40,323 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 357 transitions. [2018-04-07 02:10:40,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-07 02:10:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 357 transitions. [2018-04-07 02:10:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-04-07 02:10:40,324 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:40,324 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 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:10:40,324 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:10:40,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1356153656, 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:10:40,330 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:40,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 3 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:10:40,772 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 3 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:10:41,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:10:41,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2018-04-07 02:10:41,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-07 02:10:41,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-07 02:10:41,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=3364, Unknown=0, NotChecked=0, Total=4556 [2018-04-07 02:10:41,570 INFO L87 Difference]: Start difference. First operand 338 states and 357 transitions. Second operand 68 states. [2018-04-07 02:10:44,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:44,303 INFO L93 Difference]: Finished difference Result 668 states and 706 transitions. [2018-04-07 02:10:44,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-07 02:10:44,304 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 169 [2018-04-07 02:10:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:44,305 INFO L225 Difference]: With dead ends: 668 [2018-04-07 02:10:44,305 INFO L226 Difference]: Without dead ends: 338 [2018-04-07 02:10:44,307 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6512 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=6516, Invalid=14364, Unknown=0, NotChecked=0, Total=20880 [2018-04-07 02:10:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-07 02:10:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-04-07 02:10:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-07 02:10:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 341 transitions. [2018-04-07 02:10:44,319 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 341 transitions. Word has length 169 [2018-04-07 02:10:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:44,320 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 341 transitions. [2018-04-07 02:10:44,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-07 02:10:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 341 transitions. [2018-04-07 02:10:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-07 02:10:44,322 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:44,322 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] [2018-04-07 02:10:44,322 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:10:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1731851508, 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:10:44,333 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:44,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:45,685 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:10:45,685 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:10:49,291 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:10:49,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:10:49,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 127 [2018-04-07 02:10:49,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-07 02:10:49,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-07 02:10:49,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=14979, Unknown=0, NotChecked=0, Total=16256 [2018-04-07 02:10:49,316 INFO L87 Difference]: Start difference. First operand 338 states and 341 transitions. Second operand 128 states. [2018-04-07 02:10:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:10:55,716 INFO L93 Difference]: Finished difference Result 356 states and 360 transitions. [2018-04-07 02:10:55,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-07 02:10:55,717 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 302 [2018-04-07 02:10:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:10:55,718 INFO L225 Difference]: With dead ends: 356 [2018-04-07 02:10:55,718 INFO L226 Difference]: Without dead ends: 355 [2018-04-07 02:10:55,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3844 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=3540, Invalid=32370, Unknown=0, NotChecked=0, Total=35910 [2018-04-07 02:10:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-04-07 02:10:55,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 346. [2018-04-07 02:10:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-07 02:10:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 350 transitions. [2018-04-07 02:10:55,735 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 350 transitions. Word has length 302 [2018-04-07 02:10:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:10:55,735 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 350 transitions. [2018-04-07 02:10:55,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-07 02:10:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 350 transitions. [2018-04-07 02:10:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-04-07 02:10:55,737 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:10:55,738 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] [2018-04-07 02:10:55,738 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:10:55,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2147177873, 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:10:55,747 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:10:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:10:55,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:10:55,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:10:55,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:10:55,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:10:55,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:10:58,436 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:10:58,436 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:11:02,051 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:11:02,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:11:02,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 133 [2018-04-07 02:11:02,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-04-07 02:11:02,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-04-07 02:11:02,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1418, Invalid=16404, Unknown=0, NotChecked=0, Total=17822 [2018-04-07 02:11:02,074 INFO L87 Difference]: Start difference. First operand 346 states and 350 transitions. Second operand 134 states. [2018-04-07 02:11:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:11:13,456 INFO L93 Difference]: Finished difference Result 355 states and 359 transitions. [2018-04-07 02:11:13,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-07 02:11:13,456 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 303 [2018-04-07 02:11:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:11:13,458 INFO L225 Difference]: With dead ends: 355 [2018-04-07 02:11:13,458 INFO L226 Difference]: Without dead ends: 354 [2018-04-07 02:11:13,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10768 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=4945, Invalid=47725, Unknown=0, NotChecked=0, Total=52670 [2018-04-07 02:11:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-04-07 02:11:13,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 347. [2018-04-07 02:11:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-04-07 02:11:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 351 transitions. [2018-04-07 02:11:13,474 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 351 transitions. Word has length 303 [2018-04-07 02:11:13,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:11:13,474 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 351 transitions. [2018-04-07 02:11:13,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-04-07 02:11:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 351 transitions. [2018-04-07 02:11:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-04-07 02:11:13,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:11:13,477 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] [2018-04-07 02:11:13,477 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:11:13,477 INFO L82 PathProgramCache]: Analyzing trace with hash 137116194, 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:11:13,487 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:11:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:11:13,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:11:15,200 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:11:15,201 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:11:17,853 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:11:17,875 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:11:17,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [69, 69] imperfect sequences [] total 134 [2018-04-07 02:11:17,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-04-07 02:11:17,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-04-07 02:11:17,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3467, Invalid=14355, Unknown=0, NotChecked=0, Total=17822 [2018-04-07 02:11:17,877 INFO L87 Difference]: Start difference. First operand 347 states and 351 transitions. Second operand 134 states. [2018-04-07 02:11:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:11:22,512 INFO L93 Difference]: Finished difference Result 679 states and 688 transitions. [2018-04-07 02:11:22,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-07 02:11:22,513 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 311 [2018-04-07 02:11:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:11:22,514 INFO L225 Difference]: With dead ends: 679 [2018-04-07 02:11:22,514 INFO L226 Difference]: Without dead ends: 346 [2018-04-07 02:11:22,518 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 487 SyntacticMatches, 2 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12977 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=13102, Invalid=40954, Unknown=0, NotChecked=0, Total=54056 [2018-04-07 02:11:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-07 02:11:22,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 343. [2018-04-07 02:11:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-07 02:11:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 346 transitions. [2018-04-07 02:11:22,531 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 346 transitions. Word has length 311 [2018-04-07 02:11:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:11:22,532 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 346 transitions. [2018-04-07 02:11:22,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-04-07 02:11:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 346 transitions. [2018-04-07 02:11:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-04-07 02:11:22,534 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:11:22,534 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 31, 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:11:22,535 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:11:22,535 INFO L82 PathProgramCache]: Analyzing trace with hash -805265720, 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:11:22,543 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:11:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:11:22,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:11:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4250 backedges. 3 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:11:24,144 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:11:24,385 WARN L148 SmtUtils]: Spent 235ms on a formula simplification that was a NOOP. DAG size: 165 [2018-04-07 02:11:24,610 WARN L148 SmtUtils]: Spent 221ms on a formula simplification that was a NOOP. DAG size: 165 [2018-04-07 02:11:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4250 backedges. 3 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:11:26,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:11:26,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 131 [2018-04-07 02:11:26,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-07 02:11:26,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-07 02:11:26,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3396, Invalid=13634, Unknown=0, NotChecked=0, Total=17030 [2018-04-07 02:11:26,019 INFO L87 Difference]: Start difference. First operand 343 states and 346 transitions. Second operand 131 states. [2018-04-07 02:11:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:11:28,257 INFO L93 Difference]: Finished difference Result 675 states and 681 transitions. [2018-04-07 02:11:28,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-07 02:11:28,258 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 313 [2018-04-07 02:11:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:11:28,260 INFO L225 Difference]: With dead ends: 675 [2018-04-07 02:11:28,260 INFO L226 Difference]: Without dead ends: 343 [2018-04-07 02:11:28,263 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 494 SyntacticMatches, 2 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14761 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=9634, Invalid=27808, Unknown=0, NotChecked=0, Total=37442 [2018-04-07 02:11:28,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-07 02:11:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-04-07 02:11:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-07 02:11:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 345 transitions. [2018-04-07 02:11:28,274 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 345 transitions. Word has length 313 [2018-04-07 02:11:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:11:28,274 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 345 transitions. [2018-04-07 02:11:28,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-07 02:11:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 345 transitions. [2018-04-07 02:11:28,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-04-07 02:11:28,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:11:28,276 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 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:11:28,277 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:11:28,277 INFO L82 PathProgramCache]: Analyzing trace with hash -951258918, 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:11:28,284 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:11:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:11:28,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:11:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4531 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-07 02:11:28,476 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:11:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4531 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-07 02:11:28,631 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:11:28,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-07 02:11:28,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-07 02:11:28,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-07 02:11:28,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-07 02:11:28,633 INFO L87 Difference]: Start difference. First operand 343 states and 345 transitions. Second operand 9 states. [2018-04-07 02:11:28,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:11:28,695 INFO L93 Difference]: Finished difference Result 359 states and 361 transitions. [2018-04-07 02:11:28,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-07 02:11:28,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 322 [2018-04-07 02:11:28,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:11:28,701 INFO L225 Difference]: With dead ends: 359 [2018-04-07 02:11:28,701 INFO L226 Difference]: Without dead ends: 358 [2018-04-07 02:11:28,701 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 635 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-04-07 02:11:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-07 02:11:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2018-04-07 02:11:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-04-07 02:11:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 343 transitions. [2018-04-07 02:11:28,711 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 343 transitions. Word has length 322 [2018-04-07 02:11:28,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:11:28,712 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 343 transitions. [2018-04-07 02:11:28,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-07 02:11:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 343 transitions. [2018-04-07 02:11:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-04-07 02:11:28,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:11:28,715 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] [2018-04-07 02:11:28,715 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:11:28,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2127961249, 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:11:28,723 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:11:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:11:28,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:11:28,833 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:11:28,834 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:11:28,911 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:11:28,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:11:28,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-07 02:11:28,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-07 02:11:28,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-07 02:11:28,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-07 02:11:28,947 INFO L87 Difference]: Start difference. First operand 341 states and 343 transitions. Second operand 8 states. [2018-04-07 02:11:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:11:29,025 INFO L93 Difference]: Finished difference Result 391 states and 397 transitions. [2018-04-07 02:11:29,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-07 02:11:29,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 330 [2018-04-07 02:11:29,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:11:29,027 INFO L225 Difference]: With dead ends: 391 [2018-04-07 02:11:29,028 INFO L226 Difference]: Without dead ends: 371 [2018-04-07 02:11:29,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-07 02:11:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-07 02:11:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 361. [2018-04-07 02:11:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-04-07 02:11:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 365 transitions. [2018-04-07 02:11:29,045 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 365 transitions. Word has length 330 [2018-04-07 02:11:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:11:29,046 INFO L459 AbstractCegarLoop]: Abstraction has 361 states and 365 transitions. [2018-04-07 02:11:29,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-07 02:11:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 365 transitions. [2018-04-07 02:11:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 947 [2018-04-07 02:11:29,057 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:11:29,057 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, 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:11:29,057 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:11:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash -822354689, 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:11:29,066 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:11:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:11:29,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:11:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 41682 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 41646 trivial. 0 not checked. [2018-04-07 02:11:29,634 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:11:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 41682 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 41646 trivial. 0 not checked. [2018-04-07 02:11:30,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:11:30,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-07 02:11:30,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-07 02:11:30,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-07 02:11:30,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-04-07 02:11:30,051 INFO L87 Difference]: Start difference. First operand 361 states and 365 transitions. Second operand 16 states. [2018-04-07 02:11:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:11:30,367 INFO L93 Difference]: Finished difference Result 431 states and 443 transitions. [2018-04-07 02:11:30,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-07 02:11:30,367 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 946 [2018-04-07 02:11:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:11:30,370 INFO L225 Difference]: With dead ends: 431 [2018-04-07 02:11:30,370 INFO L226 Difference]: Without dead ends: 411 [2018-04-07 02:11:30,370 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1903 GetRequests, 1877 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=497, Unknown=0, NotChecked=0, Total=756 [2018-04-07 02:11:30,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-04-07 02:11:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 401. [2018-04-07 02:11:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-07 02:11:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 409 transitions. [2018-04-07 02:11:30,385 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 409 transitions. Word has length 946 [2018-04-07 02:11:30,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:11:30,386 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 409 transitions. [2018-04-07 02:11:30,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-07 02:11:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 409 transitions. [2018-04-07 02:11:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2179 [2018-04-07 02:11:30,411 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:11:30,412 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, 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:11:30,412 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:11:30,413 INFO L82 PathProgramCache]: Analyzing trace with hash -888116293, 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:11:30,441 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:11:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:11:30,924 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:11:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 228354 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 228130 trivial. 0 not checked. [2018-04-07 02:11:32,516 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:11:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 228354 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 228130 trivial. 0 not checked. [2018-04-07 02:11:34,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:11:34,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-07 02:11:34,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-07 02:11:34,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-07 02:11:34,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2018-04-07 02:11:34,220 INFO L87 Difference]: Start difference. First operand 401 states and 409 transitions. Second operand 32 states. [2018-04-07 02:11:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:11:34,935 INFO L93 Difference]: Finished difference Result 511 states and 535 transitions. [2018-04-07 02:11:34,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-07 02:11:34,935 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 2178 [2018-04-07 02:11:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:11:34,940 INFO L225 Difference]: With dead ends: 511 [2018-04-07 02:11:34,941 INFO L226 Difference]: Without dead ends: 491 [2018-04-07 02:11:34,942 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4383 GetRequests, 4325 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1155, Invalid=2385, Unknown=0, NotChecked=0, Total=3540 [2018-04-07 02:11:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-04-07 02:11:34,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 481. [2018-04-07 02:11:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-04-07 02:11:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 497 transitions. [2018-04-07 02:11:34,968 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 497 transitions. Word has length 2178 [2018-04-07 02:11:34,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:11:34,970 INFO L459 AbstractCegarLoop]: Abstraction has 481 states and 497 transitions. [2018-04-07 02:11:34,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-07 02:11:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 497 transitions. [2018-04-07 02:11:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4643 [2018-04-07 02:11:35,128 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:11:35,130 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, 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:11:35,130 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:11:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash 518373683, 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:11:35,139 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:11:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:11:36,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:11:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1051170 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 1050090 trivial. 0 not checked. [2018-04-07 02:11:42,652 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:11:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1051170 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 1050090 trivial. 0 not checked. [2018-04-07 02:11:49,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:11:49,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-04-07 02:11:49,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-07 02:11:49,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-07 02:11:49,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2018-04-07 02:11:49,311 INFO L87 Difference]: Start difference. First operand 481 states and 497 transitions. Second operand 64 states. [2018-04-07 02:11:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:11:50,671 INFO L93 Difference]: Finished difference Result 671 states and 719 transitions. [2018-04-07 02:11:50,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-07 02:11:50,671 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 4642 [2018-04-07 02:11:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:11:50,678 INFO L225 Difference]: With dead ends: 671 [2018-04-07 02:11:50,678 INFO L226 Difference]: Without dead ends: 651 [2018-04-07 02:11:50,680 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9343 GetRequests, 9221 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3257 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4867, Invalid=10385, Unknown=0, NotChecked=0, Total=15252 [2018-04-07 02:11:50,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-04-07 02:11:50,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 641. [2018-04-07 02:11:50,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-04-07 02:11:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 673 transitions. [2018-04-07 02:11:50,710 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 673 transitions. Word has length 4642 [2018-04-07 02:11:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:11:50,712 INFO L459 AbstractCegarLoop]: Abstraction has 641 states and 673 transitions. [2018-04-07 02:11:50,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-07 02:11:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 673 transitions. [2018-04-07 02:11:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9571 [2018-04-07 02:11:51,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:11:51,117 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, 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:11:51,118 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:11:51,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1770081315, 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:11:51,125 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:11:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:11:53,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:12:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4494690 backedges. 0 proven. 4712 refuted. 0 times theorem prover too weak. 4489978 trivial. 0 not checked. [2018-04-07 02:12:19,512 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:12:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4494690 backedges. 0 proven. 4712 refuted. 0 times theorem prover too weak. 4489978 trivial. 0 not checked. [2018-04-07 02:12:46,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:12:46,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-04-07 02:12:46,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-07 02:12:46,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-07 02:12:46,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-04-07 02:12:46,965 INFO L87 Difference]: Start difference. First operand 641 states and 673 transitions. Second operand 65 states. [2018-04-07 02:12:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:12:48,757 INFO L93 Difference]: Finished difference Result 681 states and 715 transitions. [2018-04-07 02:12:48,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-07 02:12:48,758 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 9570 [2018-04-07 02:12:48,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:12:48,766 INFO L225 Difference]: With dead ends: 681 [2018-04-07 02:12:48,766 INFO L226 Difference]: Without dead ends: 661 [2018-04-07 02:12:48,767 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19201 GetRequests, 19013 SyntacticMatches, 63 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5673 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-04-07 02:12:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-04-07 02:12:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 651. [2018-04-07 02:12:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-04-07 02:12:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 684 transitions. [2018-04-07 02:12:48,792 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 684 transitions. Word has length 9570 [2018-04-07 02:12:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:12:48,795 INFO L459 AbstractCegarLoop]: Abstraction has 651 states and 684 transitions. [2018-04-07 02:12:48,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-07 02:12:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 684 transitions. [2018-04-07 02:12:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9879 [2018-04-07 02:12:49,252 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:12:49,255 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, 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:12:49,255 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:12:49,256 INFO L82 PathProgramCache]: Analyzing trace with hash 919446546, 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:12:49,265 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:12:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:12:51,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:12:53,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-07 02:12:53,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:53,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:12:53,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:12:53,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:53,400 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:12:53,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:53,405 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:12:53,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:53,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:53,529 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:12:53,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:53,535 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:12:53,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:53,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:53,673 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:12:53,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:53,678 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:12:53,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:53,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:53,837 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:12:53,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:53,842 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:12:53,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:53,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:53,982 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:12:53,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:54,013 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:12:54,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:54,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:54,166 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:12:54,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:54,171 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:12:54,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:54,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:54,333 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:12:54,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:54,339 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:12:54,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:54,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:54,474 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:12:54,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:54,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:12:54,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:54,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:54,601 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:12:54,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:54,606 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:12:54,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:54,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:54,728 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:12:54,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:54,732 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:12:54,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:54,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:54,860 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:12:54,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:54,867 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:12:54,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:55,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:55,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:12:55,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:55,059 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:12:55,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:55,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:55,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:12:55,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:55,248 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:12:55,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:55,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:55,391 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:12:55,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:55,396 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:12:55,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:55,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:55,529 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:12:55,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:55,533 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:12:55,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:55,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:55,667 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:12:55,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:55,671 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:12:55,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:55,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:55,824 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:12:55,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:55,830 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:12:55,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:56,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:56,109 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:12:56,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:56,114 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:12:56,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:56,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:56,304 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:12:56,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:56,309 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:12:56,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:56,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:56,465 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:12:56,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:56,470 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:12:56,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:56,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:56,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:12:56,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:56,620 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:12:56,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:56,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:56,770 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:12:56,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:56,774 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:12:56,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:57,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:57,022 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:12:57,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:57,028 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:12:57,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:57,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:57,247 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:12:57,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:57,252 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:12:57,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:57,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:57,408 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:12:57,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:57,412 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:12:57,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:57,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:57,567 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:12:57,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:57,572 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:12:57,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:57,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:57,726 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:12:57,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:57,730 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:12:57,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:57,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:57,919 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:12:57,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:57,924 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:12:57,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:58,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:58,171 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:12:58,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:58,176 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:12:58,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:58,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:58,353 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:12:58,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:58,358 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:12:58,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-07 02:12:58,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:12:58,523 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:12:58,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:12:58,528 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:12:58,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-07 02:13:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4789504 backedges. 4590 proven. 294781 refuted. 0 times theorem prover too weak. 4490133 trivial. 0 not checked. [2018-04-07 02:13:29,566 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:13:36,382 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:13:36,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:13:36,384 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:13:36,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-07 02:13:36,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-07 02:13:36,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-04-07 02:13:36,797 WARN L148 SmtUtils]: Spent 404ms on a formula simplification that was a NOOP. DAG size: 167 Received shutdown request... [2018-04-07 02:14:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4789504 backedges. 0 proven. 294931 refuted. 0 times theorem prover too weak. 4494573 trivial. 0 not checked. [2018-04-07 02:14:09,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:14:09,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 76] total 137 [2018-04-07 02:14:09,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-04-07 02:14:09,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-04-07 02:14:09,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1332, Invalid=17300, Unknown=0, NotChecked=0, Total=18632 [2018-04-07 02:14:09,265 INFO L87 Difference]: Start difference. First operand 651 states and 684 transitions. Second operand 137 states. [2018-04-07 02:14:09,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-07 02:14:09,266 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-07 02:14:09,280 WARN L197 ceAbstractionStarter]: Timeout [2018-04-07 02:14:09,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 02:14:09 BasicIcfg [2018-04-07 02:14:09,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-07 02:14:09,282 INFO L168 Benchmark]: Toolchain (without parser) took 244012.83 ms. Allocated memory was 306.2 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 248.1 MB in the beginning and 472.2 MB in the end (delta: -224.1 MB). Peak memory consumption was 931.5 MB. Max. memory is 5.3 GB. [2018-04-07 02:14:09,282 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 306.2 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-07 02:14:09,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.65 ms. Allocated memory is still 306.2 MB. Free memory was 248.1 MB in the beginning and 238.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-04-07 02:14:09,288 INFO L168 Benchmark]: Boogie Preprocessor took 44.74 ms. Allocated memory is still 306.2 MB. Free memory was 238.2 MB in the beginning and 237.2 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-04-07 02:14:09,288 INFO L168 Benchmark]: RCFGBuilder took 374.63 ms. Allocated memory was 306.2 MB in the beginning and 469.2 MB in the end (delta: 163.1 MB). Free memory was 237.2 MB in the beginning and 434.9 MB in the end (delta: -197.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. [2018-04-07 02:14:09,289 INFO L168 Benchmark]: IcfgTransformer took 3230.86 ms. Allocated memory was 469.2 MB in the beginning and 528.5 MB in the end (delta: 59.2 MB). Free memory was 434.9 MB in the beginning and 452.0 MB in the end (delta: -17.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 5.3 GB. [2018-04-07 02:14:09,289 INFO L168 Benchmark]: TraceAbstraction took 240134.20 ms. Allocated memory was 528.5 MB in the beginning and 1.5 GB in the end (delta: 933.2 MB). Free memory was 452.0 MB in the beginning and 472.2 MB in the end (delta: -20.2 MB). Peak memory consumption was 913.0 MB. Max. memory is 5.3 GB. [2018-04-07 02:14:09,291 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 306.2 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.65 ms. Allocated memory is still 306.2 MB. Free memory was 248.1 MB in the beginning and 238.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.74 ms. Allocated memory is still 306.2 MB. Free memory was 238.2 MB in the beginning and 237.2 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 374.63 ms. Allocated memory was 306.2 MB in the beginning and 469.2 MB in the end (delta: 163.1 MB). Free memory was 237.2 MB in the beginning and 434.9 MB in the end (delta: -197.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. * IcfgTransformer took 3230.86 ms. Allocated memory was 469.2 MB in the beginning and 528.5 MB in the end (delta: 59.2 MB). Free memory was 434.9 MB in the beginning and 452.0 MB in the end (delta: -17.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 240134.20 ms. Allocated memory was 528.5 MB in the beginning and 1.5 GB in the end (delta: 933.2 MB). Free memory was 452.0 MB in the beginning and 472.2 MB in the end (delta: -20.2 MB). Peak memory consumption was 913.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 61 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 397 LocStat_NO_SUPPORTING_DISEQUALITIES : 108 LocStat_NO_DISJUNCTIONS : -122 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 75 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 76 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 758.69 RENAME_VARIABLES(MILLISECONDS) : 147.13 UNFREEZE(MILLISECONDS) : 0.00 CONJOIN(MILLISECONDS) : 750.15 PROJECTAWAY(MILLISECONDS) : 603.75 ADD_WEAK_EQUALITY(MILLISECONDS) : 7.46 DISJOIN(MILLISECONDS) : 39.51 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 159.88 ADD_EQUALITY(MILLISECONDS) : 14.35 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.00 ADD_DISEQUALITY(MILLISECONDS) : 0.20 #CONJOIN_DISJUNCTIVE : 202 #RENAME_VARIABLES : 426 #UNFREEZE : 0 #CONJOIN : 262 #PROJECTAWAY : 307 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 35 #RENAME_VARIABLES_DISJUNCTIVE : 422 #ADD_EQUALITY : 56 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: WeqCcManagerStatistics FREEZE(MILLISECONDS) : 1502.69 ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 745.33 FILTERREDUNDANT(MILLISECONDS) : 0.00 REPORTWEQ(MILLISECONDS) : 7.33 JOIN(MILLISECONDS) : 36.93 RENAMEVARS(MILLISECONDS) : 140.74 FLATTENLABELS(MILLISECONDS) : 0.00 COPY(MILLISECONDS) : 0.00 ISSTRONGERTHAN(MILLISECONDS) : 1145.94 ISLABELSTRONGERTHAN(MILLISECONDS) : 106.61 ISWEQGRAPHSTRONGERTHAN(MILLISECONDS) : 16.18 UNFREEZE(MILLISECONDS) : 29.71 REPORTCONTAINS(MILLISECONDS) : 0.31 PROJECTAWAY(MILLISECONDS) : 546.96 MEETEDGELABELS(MILLISECONDS) : 89.77 REPORTEQUALITY(MILLISECONDS) : 175.24 ADDALLNODES(MILLISECONDS) : 129.99 REPORTDISEQUALITY(MILLISECONDS) : 2.02 WEQGRAPHJOIN(MILLISECONDS) : 14.64 #FREEZE : 1339 #ADDNODE : 0 #MEET : 166 #FILTERREDUNDANT : 0 #REPORTWEQ : 7 #JOIN : 35 #RENAMEVARS : 426 #FLATTENLABELS : 0 #COPY : 0 #ISSTRONGERTHAN : 367 #ISLABELSTRONGERTHAN : 2944 #ISWEQGRAPHSTRONGERTHAN : 109 #UNFREEZE : 957 #REPORTCONTAINS : 9 #PROJECTAWAY : 365 #MEETEDGELABELS : 539 #REPORTEQUALITY : 1161 #ADDALLNODES : 166 #REPORTDISEQUALITY : 309 #WEQGRAPHJOIN : 35 - StatisticsResult: CcManagerStatistics ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 514.88 REPORT_EQUALITY(MILLISECONDS) : 151.26 FILTERREDUNDANT(MILLISECONDS) : 737.87 ADD_ALL_ELEMENTS(MILLISECONDS) : 111.06 JOIN(MILLISECONDS) : 15.08 ALIGN_ELEMENTS(MILLISECONDS) : 311.05 COPY(MILLISECONDS) : 0.00 REPORT_DISEQUALITY(MILLISECONDS) : 52.13 UNFREEZE(MILLISECONDS) : 0.00 OVERALL(MILLISECONDS) : 1149.38 REPORTCONTAINS(MILLISECONDS) : 6.36 IS_STRONGER_THAN_NO_CACHING(MILLISECONDS) : 474.59 REMOVE(MILLISECONDS) : 0.00 IS_STRONGER_THAN_W_CACHING(MILLISECONDS) : 0.00 PROJECT_TO_ELEMENTS(MILLISECONDS) : 236.94 #ADDNODE : 0 #MEET : 1932 #REPORT_EQUALITY : 11192 #FILTERREDUNDANT : 9004 #ADD_ALL_ELEMENTS : 8406 #JOIN : 35 #ALIGN_ELEMENTS : 3140 #COPY : 0 #REPORT_DISEQUALITY : 4828 #UNFREEZE : 0 #OVERALL : 52584 #REPORTCONTAINS : 321 #IS_STRONGER_THAN_NO_CACHING : 11712 #REMOVE : 0 #IS_STRONGER_THAN_W_CACHING : 0 #PROJECT_TO_ELEMENTS : 2014 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 16). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 2 states, 137 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 16). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 2 states, 137 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 16). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 2 states, 137 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 29). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 2 states, 137 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 2 states, 137 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (651states) and interpolant automaton (currently 2 states, 137 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 62 locations, 6 error locations. TIMEOUT Result, 240.0s OverallTime, 28 OverallIterations, 1056 TraceHistogramMax, 55.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2047 SDtfs, 9285 SDslu, 40739 SDs, 0 SdLazy, 40061 SolverSat, 2542 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61375 GetRequests, 59050 SyntacticMatches, 168 SemanticMatches, 2157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76884 ImplicationChecksByTransitivity, 77.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=651occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 355 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.1s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 176.1s InterpolantComputationTime, 30240 NumberOfCodeBlocks, 30240 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 60424 ConstructedInterpolants, 7 QuantifiedInterpolants, 519501422 SizeOfPredicates, 753 NumberOfNonLiveVariables, 54361 ConjunctsInSsa, 1135 ConjunctsInUnsatCore, 56 InterpolantComputations, 14 PerfectInterpolantSequences, 20636258/21271180 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-04-07_02-14-09-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-04-07_02-14-09-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-04-07_02-14-09-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-1-2018-04-07_02-14-09-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-2-2018-04-07_02-14-09-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-04-07_02-14-09-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-07_02-14-09-311.csv Completed graceful shutdown