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/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-835382a-m [2018-04-05 21:53:12,397 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-05 21:53:12,398 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-05 21:53:12,411 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-05 21:53:12,411 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-05 21:53:12,412 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-05 21:53:12,413 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-05 21:53:12,415 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-05 21:53:12,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-05 21:53:12,417 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-05 21:53:12,418 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-05 21:53:12,419 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-05 21:53:12,419 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-05 21:53:12,421 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-05 21:53:12,422 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-05 21:53:12,424 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-05 21:53:12,426 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-05 21:53:12,427 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-05 21:53:12,429 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-05 21:53:12,430 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-05 21:53:12,432 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-05 21:53:12,432 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-05 21:53:12,433 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-05 21:53:12,434 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-05 21:53:12,434 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-05 21:53:12,436 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-05 21:53:12,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-05 21:53:12,437 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-05 21:53:12,437 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-05 21:53:12,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-05 21:53:12,438 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-05 21:53:12,438 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-05 21:53:12,461 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-05 21:53:12,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-05 21:53:12,461 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-05 21:53:12,461 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-05 21:53:12,462 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-05 21:53:12,462 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-05 21:53:12,462 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-05 21:53:12,462 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-05 21:53:12,462 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-05 21:53:12,463 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-05 21:53:12,463 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-05 21:53:12,463 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-05 21:53:12,463 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-05 21:53:12,463 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-05 21:53:12,463 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-05 21:53:12,463 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-05 21:53:12,464 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-05 21:53:12,464 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-05 21:53:12,464 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-05 21:53:12,464 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-05 21:53:12,464 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-05 21:53:12,464 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-05 21:53:12,465 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-05 21:53:12,465 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-05 21:53:12,465 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-05 21:53:12,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 21:53:12,465 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-05 21:53:12,466 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-05 21:53:12,466 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-05 21:53:12,466 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-05 21:53:12,466 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-05 21:53:12,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:12,466 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-05 21:53:12,467 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-05 21:53:12,467 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-05 21:53:12,467 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-05 21:53:12,468 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-05 21:53:12,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-05 21:53:12,511 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-05 21:53:12,513 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-05 21:53:12,515 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-05 21:53:12,515 INFO L276 PluginConnector]: CDTParser initialized [2018-04-05 21:53:12,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-04-05 21:53:12,807 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb02691925 [2018-04-05 21:53:12,919 INFO L287 CDTParser]: IsIndexed: true [2018-04-05 21:53:12,919 INFO L288 CDTParser]: Found 1 translation units. [2018-04-05 21:53:12,919 INFO L168 CDTParser]: Scanning ArraysOfVariableLength_true-valid-memsafety.c [2018-04-05 21:53:12,920 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-05 21:53:12,920 INFO L215 ultiparseSymbolTable]: [2018-04-05 21:53:12,920 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-05 21:53:12,921 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength_true-valid-memsafety.c [2018-04-05 21:53:12,921 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength_true-valid-memsafety.c [2018-04-05 21:53:12,921 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-05 21:53:12,921 INFO L233 ultiparseSymbolTable]: [2018-04-05 21:53:12,935 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb02691925 [2018-04-05 21:53:12,939 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-05 21:53:12,941 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-04-05 21:53:12,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-05 21:53:12,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-05 21:53:12,949 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-05 21:53:12,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 09:53:12" (1/1) ... [2018-04-05 21:53:12,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a9f7e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:53:12, skipping insertion in model container [2018-04-05 21:53:12,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 09:53:12" (1/1) ... [2018-04-05 21:53:12,968 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 21:53:12,978 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 21:53:13,111 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 21:53:13,131 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 21:53:13,136 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-05 21:53:13,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:53:13 WrapperNode [2018-04-05 21:53:13,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-05 21:53:13,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-05 21:53:13,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-05 21:53:13,144 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-05 21:53:13,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:53:13" (1/1) ... [2018-04-05 21:53:13,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:53:13" (1/1) ... [2018-04-05 21:53:13,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:53:13" (1/1) ... [2018-04-05 21:53:13,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:53:13" (1/1) ... [2018-04-05 21:53:13,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:53:13" (1/1) ... [2018-04-05 21:53:13,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:53:13" (1/1) ... [2018-04-05 21:53:13,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:53:13" (1/1) ... [2018-04-05 21:53:13,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-05 21:53:13,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-05 21:53:13,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-05 21:53:13,177 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-05 21:53:13,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:53:13" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 21:53:13,241 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-05 21:53:13,241 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-05 21:53:13,241 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo [2018-04-05 21:53:13,241 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-05 21:53:13,241 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo [2018-04-05 21:53:13,241 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-05 21:53:13,242 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-05 21:53:13,242 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-05 21:53:13,242 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-05 21:53:13,242 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-05 21:53:13,242 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-05 21:53:13,242 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-05 21:53:13,242 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-05 21:53:13,502 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-05 21:53:13,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 09:53:13 BoogieIcfgContainer [2018-04-05 21:53:13,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-05 21:53:13,503 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-04-05 21:53:13,503 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-04-05 21:53:13,504 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-04-05 21:53:13,506 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 09:53:13" (1/1) ... [2018-04-05 21:53:13,513 INFO L139 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-04-05 21:53:13,514 INFO L140 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-04-05 21:53:13,527 INFO L299 apSepIcfgTransformer]: Heap separator: starting memloc-array-style preprocessing [2018-04-05 21:53:13,540 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-05 21:53:13,540 INFO L332 apSepIcfgTransformer]: finished MemlocArrayUpdater, created 2 location literals (each corresponds to one heap write) [2018-04-05 21:53:13,546 INFO L100 SccComputation]: Graph consists of 1 InCaSumBalls and 8 non ball SCCs. Number of states in SCCs 9. [2018-04-05 21:53:13,548 INFO L412 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-04-05 21:53:13,549 DEBUG L416 apSepIcfgTransformer]: storeIndexInfoToLocLiteral: Map: (Store [1] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6))) : |mll_L23''_1| (Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|) : |mll_L23''_0| [2018-04-05 21:53:13,551 DEBUG L418 apSepIcfgTransformer]: edgeToIndexToStoreIndexInfo: NestedMap2: (SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') : |v_main_~#b~0.base_3| : (Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|) (SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') : (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6)) : (Store [1] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6))) [2018-04-05 21:53:13,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-04-05 21:53:32,114 INFO L314 AbstractInterpreter]: Visited 71 different actions 425 times. Merged at 48 different actions 234 times. Widened at 2 different actions 2 times. Found 20 fixpoints after 7 different actions. Largest state had 31 variables. [2018-04-05 21:53:32,116 INFO L424 apSepIcfgTransformer]: finished equality analysis [2018-04-05 21:53:32,124 INFO L195 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 3 [2018-04-05 21:53:32,124 INFO L434 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-04-05 21:53:32,124 INFO L435 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-04-05 21:53:32,125 INFO L437 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_5| |v_main_~#b~0.base_6|) (+ |v_main_~#b~0.offset_5| (* 4 v_main_~i~1_13))), at (SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L26)) ((select |v_#memory_int_4| |v_main_~#b~0.base_3|), at (SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'')) ((select (select |v_#memory_int_6| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2) (+ (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6) v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 4, 4); srcloc: L15')) [2018-04-05 21:53:32,160 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_31 [2018-04-05 21:53:32,160 DEBUG L374 HeapPartitionManager]: with contents [(Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|)] [2018-04-05 21:53:32,160 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_31 [2018-04-05 21:53:32,160 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select (select |v_#memory_int_5| |v_main_~#b~0.base_6|) (+ |v_main_~#b~0.offset_5| (* 4 v_main_~i~1_13))), at (SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L26)) [2018-04-05 21:53:32,161 DEBUG L325 HeapPartitionManager]: write locations: [(Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|)] [2018-04-05 21:53:32,161 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_32 [2018-04-05 21:53:32,161 DEBUG L374 HeapPartitionManager]: with contents [(Store [1] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6)))] [2018-04-05 21:53:32,161 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_32 [2018-04-05 21:53:32,161 DEBUG L324 HeapPartitionManager]: at dimension 1 for ((select (select |v_#memory_int_5| |v_main_~#b~0.base_6|) (+ |v_main_~#b~0.offset_5| (* 4 v_main_~i~1_13))), at (SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L26)) [2018-04-05 21:53:32,161 DEBUG L325 HeapPartitionManager]: write locations: [(Store [1] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6)))] [2018-04-05 21:53:32,161 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_31 [2018-04-05 21:53:32,162 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select |v_#memory_int_4| |v_main_~#b~0.base_3|), at (SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'')) [2018-04-05 21:53:32,162 DEBUG L325 HeapPartitionManager]: write locations: [(Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|)] [2018-04-05 21:53:32,162 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_31 [2018-04-05 21:53:32,162 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select (select |v_#memory_int_6| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2) (+ (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6) v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 4, 4); srcloc: L15')) [2018-04-05 21:53:32,162 DEBUG L325 HeapPartitionManager]: write locations: [(Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|)] [2018-04-05 21:53:32,162 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_32 [2018-04-05 21:53:32,163 DEBUG L324 HeapPartitionManager]: at dimension 1 for ((select (select |v_#memory_int_6| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2) (+ (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6) v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 4, 4); srcloc: L15')) [2018-04-05 21:53:32,163 DEBUG L325 HeapPartitionManager]: write locations: [(Store [1] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6)))] [2018-04-05 21:53:32,163 INFO L330 HeapPartitionManager]: partitioning result: [2018-04-05 21:53:32,163 INFO L335 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-04-05 21:53:32,163 INFO L344 HeapPartitionManager]: at dimension 0 [2018-04-05 21:53:32,163 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-04-05 21:53:32,163 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-05 21:53:32,163 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-05 21:53:32,164 DEBUG L356 HeapPartitionManager]: [(Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|)] [2018-04-05 21:53:32,164 INFO L344 HeapPartitionManager]: at dimension 1 [2018-04-05 21:53:32,164 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-04-05 21:53:32,164 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-05 21:53:32,164 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-05 21:53:32,164 DEBUG L356 HeapPartitionManager]: [(Store [1] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6)))] [2018-04-05 21:53:32,165 INFO L131 ransitionTransformer]: executing heap partitioning transformation [2018-04-05 21:53:32,167 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,168 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,168 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,168 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,169 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,169 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,169 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,169 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,170 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,170 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-05 21:53:32,170 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,171 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,171 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,171 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,171 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,171 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,172 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,172 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~i~1=v_main_~i~1_1} AuxVars[] AssignedVars[main_~i~1] [2018-04-05 21:53:32,172 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,172 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,173 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,173 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-05 21:53:32,173 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,173 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,174 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,174 DEBUG L281 ransitionTransformer]: Formula: (and (= 0 |v_main_~#b~0.offset_1|) (= |v_#valid_9| (store |v_#valid_10| |v_main_~#b~0.base_1| 1)) (not (= 0 |v_main_~#b~0.base_1|)) (= 0 (select |v_#valid_10| |v_main_~#b~0.base_1|)) (= (store |v_#length_4| |v_main_~#b~0.base_1| 400) |v_#length_3|)) InVars {#length=|v_#length_4|, #valid=|v_#valid_10|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_1|, #length=|v_#length_3|, #valid=|v_#valid_9|, main_~#b~0.offset=|v_main_~#b~0.offset_1|} AuxVars[] AssignedVars[main_~#b~0.base, #valid, #length, main_~#b~0.offset] [2018-04-05 21:53:32,174 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,174 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,175 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,175 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,175 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,175 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,175 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,176 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_2 0) InVars {} OutVars{main_~i~1=v_main_~i~1_2} AuxVars[] AssignedVars[main_~i~1] [2018-04-05 21:53:32,176 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,176 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,176 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,177 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,177 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,177 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,177 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,177 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,178 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,178 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,178 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,178 DEBUG L281 ransitionTransformer]: Formula: (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-05 21:53:32,179 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,179 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,179 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,179 DEBUG L281 ransitionTransformer]: Formula: (< v_main_~i~1_4 100) InVars {main_~i~1=v_main_~i~1_4} OutVars{main_~i~1=v_main_~i~1_4} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,179 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,180 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,180 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,180 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_10 0) InVars {} OutVars{main_~i~1=v_main_~i~1_10} AuxVars[] AssignedVars[main_~i~1] [2018-04-05 21:53:32,180 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,181 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,181 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,181 DEBUG L281 ransitionTransformer]: Formula: (and (= |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offsetInParam_1| |v_main_~#b~0.offset_11|) (= |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~sizeInParam_1| v_main_~i~1_19) (= |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~nInParam_1| v_main_~i~1_19) (= |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.baseInParam_1| |v_main_~#b~0.base_13|)) InVars {main_~#b~0.base=|v_main_~#b~0.base_13|, main_~i~1=v_main_~i~1_19, main_~#b~0.offset=|v_main_~#b~0.offset_11|} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~sizeInParam_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offsetInParam_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.baseInParam_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~nInParam_1|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n] [2018-04-05 21:53:32,181 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,182 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,182 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,194 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,195 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,195 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,195 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,195 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,195 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,196 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,196 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,196 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-05 21:53:32,196 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,196 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,197 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,197 DEBUG L281 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n_1 |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n_1|) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n_1|} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n] [2018-04-05 21:53:32,197 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,197 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,197 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,198 DEBUG L281 ransitionTransformer]: Formula: (not (< v_main_~i~1_11 100)) InVars {main_~i~1=v_main_~i~1_11} OutVars{main_~i~1=v_main_~i~1_11} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,198 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,198 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,198 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,198 DEBUG L281 ransitionTransformer]: Formula: (< v_main_~i~1_12 100) InVars {main_~i~1=v_main_~i~1_12} OutVars{main_~i~1=v_main_~i~1_12} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,198 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,199 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,199 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,199 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#res_2| 0) InVars {} OutVars{main_#res=|v_main_#res_2|} AuxVars[] AssignedVars[main_#res] [2018-04-05 21:53:32,199 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,199 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,203 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,203 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse0 (* 4 v_main_~i~1_6))) (let ((.cse1 (+ |v_main_~#b~0.offset_3| .cse0))) (and (<= (+ |v_main_~#b~0.offset_3| .cse0 4) (select |v_#length_5| |v_main_~#b~0.base_3|)) (= (store |v_#memory_int_part_locs_31_locs_32_1| |v_main_~#b~0.base_3| (store (select |v_#memory_int_part_locs_31_locs_32_1| |v_main_~#b~0.base_3|) .cse1 |v_main_#t~ret3_3|)) |v_#memory_int_part_locs_31_locs_32_2|) (<= 0 .cse1) (= 1 (select |v_#valid_11| |v_main_~#b~0.base_3|))))) InVars {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_1|, main_~#b~0.base=|v_main_~#b~0.base_3|, main_#t~ret3=|v_main_#t~ret3_3|, #valid=|v_#valid_11|, main_~i~1=v_main_~i~1_6, #length=|v_#length_5|, main_~#b~0.offset=|v_main_~#b~0.offset_3|} OutVars{#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_2|, main_~#b~0.base=|v_main_~#b~0.base_3|, main_#t~ret3=|v_main_#t~ret3_3|, #valid=|v_#valid_11|, main_~i~1=v_main_~i~1_6, #length=|v_#length_5|, main_~#b~0.offset=|v_main_~#b~0.offset_3|} AuxVars[] AssignedVars[#memory_int_part_locs_31_locs_32] [2018-04-05 21:53:32,203 DEBUG L288 ransitionTransformer]: formula has changed [2018-04-05 21:53:32,204 DEBUG L289 ransitionTransformer]: old formula: [2018-04-05 21:53:32,204 DEBUG L290 ransitionTransformer]: (let ((.cse0 (* 4 v_main_~i~1_6))) (let ((.cse1 (+ |v_main_~#b~0.offset_3| .cse0))) (and (<= (+ |v_main_~#b~0.offset_3| .cse0 4) (select |v_#length_5| |v_main_~#b~0.base_3|)) (= (store |v_#memory_int_4| |v_main_~#b~0.base_3| (store (select |v_#memory_int_4| |v_main_~#b~0.base_3|) .cse1 |v_main_#t~ret3_3|)) |v_#memory_int_3|) (<= 0 .cse1) (= 1 (select |v_#valid_11| |v_main_~#b~0.base_3|))))) [2018-04-05 21:53:32,204 DEBUG L291 ransitionTransformer]: new formula: [2018-04-05 21:53:32,204 DEBUG L292 ransitionTransformer]: (let ((.cse0 (* 4 v_main_~i~1_6))) (let ((.cse1 (+ |v_main_~#b~0.offset_3| .cse0))) (and (<= (+ |v_main_~#b~0.offset_3| .cse0 4) (select |v_#length_5| |v_main_~#b~0.base_3|)) (= (store |v_#memory_int_part_locs_31_locs_32_1| |v_main_~#b~0.base_3| (store (select |v_#memory_int_part_locs_31_locs_32_1| |v_main_~#b~0.base_3|) .cse1 |v_main_#t~ret3_3|)) |v_#memory_int_part_locs_31_locs_32_2|) (<= 0 .cse1) (= 1 (select |v_#valid_11| |v_main_~#b~0.base_3|))))) [2018-04-05 21:53:32,204 DEBUG L296 ransitionTransformer]: invars have changed [2018-04-05 21:53:32,205 DEBUG L297 ransitionTransformer]: old invars: [2018-04-05 21:53:32,205 DEBUG L298 ransitionTransformer]: {main_~#b~0.base=|v_main_~#b~0.base_3|, main_#t~ret3=|v_main_#t~ret3_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, main_~i~1=v_main_~i~1_6, #length=|v_#length_5|, main_~#b~0.offset=|v_main_~#b~0.offset_3|} [2018-04-05 21:53:32,205 DEBUG L299 ransitionTransformer]: new invars: [2018-04-05 21:53:32,205 DEBUG L300 ransitionTransformer]: {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_1|, main_~#b~0.base=|v_main_~#b~0.base_3|, main_#t~ret3=|v_main_#t~ret3_3|, #valid=|v_#valid_11|, main_~i~1=v_main_~i~1_6, #length=|v_#length_5|, main_~#b~0.offset=|v_main_~#b~0.offset_3|} [2018-04-05 21:53:32,205 DEBUG L304 ransitionTransformer]: outvars have changed [2018-04-05 21:53:32,205 DEBUG L305 ransitionTransformer]: old outvars: [2018-04-05 21:53:32,206 DEBUG L306 ransitionTransformer]: {main_~#b~0.base=|v_main_~#b~0.base_3|, main_#t~ret3=|v_main_#t~ret3_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, main_~i~1=v_main_~i~1_6, #length=|v_#length_5|, main_~#b~0.offset=|v_main_~#b~0.offset_3|} [2018-04-05 21:53:32,206 DEBUG L307 ransitionTransformer]: new outvars: [2018-04-05 21:53:32,206 DEBUG L308 ransitionTransformer]: {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_2|, main_~#b~0.base=|v_main_~#b~0.base_3|, main_#t~ret3=|v_main_#t~ret3_3|, #valid=|v_#valid_11|, main_~i~1=v_main_~i~1_6, #length=|v_#length_5|, main_~#b~0.offset=|v_main_~#b~0.offset_3|} [2018-04-05 21:53:32,206 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,206 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,207 DEBUG L281 ransitionTransformer]: Formula: (not (= (select |v_#valid_12| |v_main_~#b~0.base_4|) 1)) InVars {main_~#b~0.base=|v_main_~#b~0.base_4|, #valid=|v_#valid_12|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_4|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,207 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,207 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,207 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,208 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse0 (* 4 v_main_~i~1_7))) (or (not (<= 0 (+ .cse0 |v_main_~#b~0.offset_4|))) (not (<= (+ .cse0 |v_main_~#b~0.offset_4| 4) (select |v_#length_6| |v_main_~#b~0.base_5|))))) InVars {main_~#b~0.base=|v_main_~#b~0.base_5|, main_~i~1=v_main_~i~1_7, #length=|v_#length_6|, main_~#b~0.offset=|v_main_~#b~0.offset_4|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_5|, main_~i~1=v_main_~i~1_7, #length=|v_#length_6|, main_~#b~0.offset=|v_main_~#b~0.offset_4|} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,208 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,208 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,208 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,208 DEBUG L281 ransitionTransformer]: Formula: (and (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_1 |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset_1|) (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_1 |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base_1|)) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base_1|} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_1, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset] [2018-04-05 21:53:32,208 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,209 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,209 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,210 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse0 (* 4 v_main_~i~1_13))) (let ((.cse1 (+ |v_main_~#b~0.offset_5| .cse0))) (and (= 1 (select |v_#valid_13| |v_main_~#b~0.base_6|)) (<= (+ |v_main_~#b~0.offset_5| .cse0 4) (select |v_#length_7| |v_main_~#b~0.base_6|)) (<= 0 .cse1) (= |v_main_#t~mem5_1| (select (select |v_#memory_int_part_locs_31_locs_32_3| |v_main_~#b~0.base_6|) .cse1))))) InVars {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_3|, main_~#b~0.base=|v_main_~#b~0.base_6|, #valid=|v_#valid_13|, main_~i~1=v_main_~i~1_13, #length=|v_#length_7|, main_~#b~0.offset=|v_main_~#b~0.offset_5|} OutVars{#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_3|, main_~#b~0.base=|v_main_~#b~0.base_6|, #valid=|v_#valid_13|, main_~i~1=v_main_~i~1_13, main_#t~mem5=|v_main_#t~mem5_1|, #length=|v_#length_7|, main_~#b~0.offset=|v_main_~#b~0.offset_5|} AuxVars[] AssignedVars[main_#t~mem5] [2018-04-05 21:53:32,210 DEBUG L288 ransitionTransformer]: formula has changed [2018-04-05 21:53:32,210 DEBUG L289 ransitionTransformer]: old formula: [2018-04-05 21:53:32,210 DEBUG L290 ransitionTransformer]: (let ((.cse0 (* 4 v_main_~i~1_13))) (let ((.cse1 (+ |v_main_~#b~0.offset_5| .cse0))) (and (= 1 (select |v_#valid_13| |v_main_~#b~0.base_6|)) (<= (+ |v_main_~#b~0.offset_5| .cse0 4) (select |v_#length_7| |v_main_~#b~0.base_6|)) (<= 0 .cse1) (= |v_main_#t~mem5_1| (select (select |v_#memory_int_5| |v_main_~#b~0.base_6|) .cse1))))) [2018-04-05 21:53:32,210 DEBUG L291 ransitionTransformer]: new formula: [2018-04-05 21:53:32,210 DEBUG L292 ransitionTransformer]: (let ((.cse0 (* 4 v_main_~i~1_13))) (let ((.cse1 (+ |v_main_~#b~0.offset_5| .cse0))) (and (= 1 (select |v_#valid_13| |v_main_~#b~0.base_6|)) (<= (+ |v_main_~#b~0.offset_5| .cse0 4) (select |v_#length_7| |v_main_~#b~0.base_6|)) (<= 0 .cse1) (= |v_main_#t~mem5_1| (select (select |v_#memory_int_part_locs_31_locs_32_3| |v_main_~#b~0.base_6|) .cse1))))) [2018-04-05 21:53:32,211 DEBUG L296 ransitionTransformer]: invars have changed [2018-04-05 21:53:32,211 DEBUG L297 ransitionTransformer]: old invars: [2018-04-05 21:53:32,211 DEBUG L298 ransitionTransformer]: {main_~#b~0.base=|v_main_~#b~0.base_6|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, main_~i~1=v_main_~i~1_13, #length=|v_#length_7|, main_~#b~0.offset=|v_main_~#b~0.offset_5|} [2018-04-05 21:53:32,211 DEBUG L299 ransitionTransformer]: new invars: [2018-04-05 21:53:32,211 DEBUG L300 ransitionTransformer]: {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_3|, main_~#b~0.base=|v_main_~#b~0.base_6|, #valid=|v_#valid_13|, main_~i~1=v_main_~i~1_13, #length=|v_#length_7|, main_~#b~0.offset=|v_main_~#b~0.offset_5|} [2018-04-05 21:53:32,211 DEBUG L304 ransitionTransformer]: outvars have changed [2018-04-05 21:53:32,212 DEBUG L305 ransitionTransformer]: old outvars: [2018-04-05 21:53:32,212 DEBUG L306 ransitionTransformer]: {main_~#b~0.base=|v_main_~#b~0.base_6|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, main_~i~1=v_main_~i~1_13, main_#t~mem5=|v_main_#t~mem5_1|, #length=|v_#length_7|, main_~#b~0.offset=|v_main_~#b~0.offset_5|} [2018-04-05 21:53:32,212 DEBUG L307 ransitionTransformer]: new outvars: [2018-04-05 21:53:32,212 DEBUG L308 ransitionTransformer]: {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_3|, main_~#b~0.base=|v_main_~#b~0.base_6|, #valid=|v_#valid_13|, main_~i~1=v_main_~i~1_13, main_#t~mem5=|v_main_#t~mem5_1|, #length=|v_#length_7|, main_~#b~0.offset=|v_main_~#b~0.offset_5|} [2018-04-05 21:53:32,212 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,213 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,213 DEBUG L281 ransitionTransformer]: Formula: (not (= (select |v_#valid_14| |v_main_~#b~0.base_7|) 1)) InVars {main_~#b~0.base=|v_main_~#b~0.base_7|, #valid=|v_#valid_14|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_7|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,213 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,213 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,213 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,214 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse0 (* 4 v_main_~i~1_14))) (or (not (<= 0 (+ |v_main_~#b~0.offset_6| .cse0))) (not (<= (+ |v_main_~#b~0.offset_6| .cse0 4) (select |v_#length_8| |v_main_~#b~0.base_8|))))) InVars {main_~#b~0.base=|v_main_~#b~0.base_8|, main_~i~1=v_main_~i~1_14, #length=|v_#length_8|, main_~#b~0.offset=|v_main_~#b~0.offset_6|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_8|, main_~i~1=v_main_~i~1_14, #length=|v_#length_8|, main_~#b~0.offset=|v_main_~#b~0.offset_6|} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,214 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,214 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,214 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,214 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_17| (store |v_#valid_18| |v_main_~#b~0.base_11| 0)) InVars {main_~#b~0.base=|v_main_~#b~0.base_11|, #valid=|v_#valid_18|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_11|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#valid] [2018-04-05 21:53:32,215 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,215 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,215 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,215 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~ret3=|v_main_#t~ret3_4|} AuxVars[] AssignedVars[main_#t~ret3] [2018-04-05 21:53:32,215 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,215 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,216 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,216 DEBUG L281 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_1 |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size_1|) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size_1|} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size] [2018-04-05 21:53:32,216 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,216 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,217 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,217 DEBUG L281 ransitionTransformer]: Formula: (not (= v_main_~i~1_15 |v_main_#t~mem5_2|)) InVars {main_~i~1=v_main_~i~1_15, main_#t~mem5=|v_main_#t~mem5_2|} OutVars{main_~i~1=v_main_~i~1_15, main_#t~mem5=|v_main_#t~mem5_2|} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,217 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,217 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,217 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,217 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_16 |v_main_#t~mem5_4|) InVars {main_~i~1=v_main_~i~1_16, main_#t~mem5=|v_main_#t~mem5_4|} OutVars{main_~i~1=v_main_~i~1_16, main_#t~mem5=|v_main_#t~mem5_4|} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,218 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,218 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,218 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,218 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~#b~0.base=|v_main_~#b~0.base_12|, main_~#b~0.offset=|v_main_~#b~0.offset_10|} AuxVars[] AssignedVars[main_~#b~0.base, main_~#b~0.offset] [2018-04-05 21:53:32,218 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,218 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,219 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,219 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#t~post2_1| v_main_~i~1_8) InVars {main_~i~1=v_main_~i~1_8} OutVars{main_~i~1=v_main_~i~1_8, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2] [2018-04-05 21:53:32,219 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,219 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,219 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,220 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0] [2018-04-05 21:53:32,220 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,220 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,220 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,220 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~mem5=|v_main_#t~mem5_3|} AuxVars[] AssignedVars[main_#t~mem5] [2018-04-05 21:53:32,220 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,220 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,221 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,221 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~mem5=|v_main_#t~mem5_5|} AuxVars[] AssignedVars[main_#t~mem5] [2018-04-05 21:53:32,221 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,221 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,222 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,222 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_7| |old(#valid)|) InVars {#valid=|v_#valid_7|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_7|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,222 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,222 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,222 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,222 DEBUG L281 ransitionTransformer]: Formula: (not (= |v_#valid_8| |old(#valid)|)) InVars {#valid=|v_#valid_8|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_8|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,223 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,223 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,223 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,223 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_9 (+ |v_main_#t~post2_2| 1)) InVars {main_#t~post2=|v_main_#t~post2_2|} OutVars{main_~i~1=v_main_~i~1_9, main_#t~post2=|v_main_#t~post2_2|} AuxVars[] AssignedVars[main_~i~1] [2018-04-05 21:53:32,223 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,224 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,224 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,224 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0] [2018-04-05 21:53:32,224 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,224 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,225 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,225 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#res_1| 1) InVars {} OutVars{main_#res=|v_main_#res_1|} AuxVars[] AssignedVars[main_#res] [2018-04-05 21:53:32,225 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,225 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,225 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,225 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#t~post4_1| v_main_~i~1_17) InVars {main_~i~1=v_main_~i~1_17} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~1=v_main_~i~1_17} AuxVars[] AssignedVars[main_#t~post4] [2018-04-05 21:53:32,226 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,226 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,226 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,226 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~post2=|v_main_#t~post2_3|} AuxVars[] AssignedVars[main_#t~post2] [2018-04-05 21:53:32,226 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,226 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,227 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,227 DEBUG L281 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_2 0) InVars {} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_2} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0] [2018-04-05 21:53:32,227 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,227 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,227 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,228 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_15| (store |v_#valid_16| |v_main_~#b~0.base_9| 0)) InVars {main_~#b~0.base=|v_main_~#b~0.base_9|, #valid=|v_#valid_16|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_9|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid] [2018-04-05 21:53:32,228 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,228 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,228 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,228 DEBUG L281 ransitionTransformer]: Formula: (= v_main_~i~1_18 (+ |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_18} AuxVars[] AssignedVars[main_~i~1] [2018-04-05 21:53:32,228 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,229 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,229 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,229 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,229 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,229 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,229 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,230 DEBUG L281 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,230 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,230 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,230 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,230 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~#b~0.base=|v_main_~#b~0.base_10|, main_~#b~0.offset=|v_main_~#b~0.offset_8|} AuxVars[] AssignedVars[main_~#b~0.base, main_~#b~0.offset] [2018-04-05 21:53:32,230 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,230 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,231 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,231 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~post4=|v_main_#t~post4_3|} AuxVars[] AssignedVars[main_#t~post4] [2018-04-05 21:53:32,231 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,231 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,231 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,232 DEBUG L281 ransitionTransformer]: Formula: (not (< v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_3 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_2)) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_2, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_3} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_2, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_3} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,232 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,232 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,232 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,232 DEBUG L281 ransitionTransformer]: Formula: (< v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_3) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_3, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_4} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_3, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_4} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,232 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,233 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,233 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,233 DEBUG L281 ransitionTransformer]: Formula: (= |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#res_1| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_11) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_11} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#res=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#res_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_11} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#res] [2018-04-05 21:53:32,233 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,233 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,233 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,234 DEBUG L281 ransitionTransformer]: Formula: (or (not (<= 0 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_5)) (not (< v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_5 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n_2))) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_5, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n_2} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_5, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n_2} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,234 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,234 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,234 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,234 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,234 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,235 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,235 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,235 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,235 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,235 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,236 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,236 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse1 (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6))) (let ((.cse0 (+ .cse1 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2))) (and (= (select (select |v_#memory_int_part_locs_31_locs_32_4| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2) .cse0) |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_1|) (= 1 (select |v_#valid_19| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2)) (<= (+ .cse1 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2 4) (select |v_#length_9| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2)) (<= 0 .cse0)))) InVars {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_4|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2, #valid=|v_#valid_19|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6, #length=|v_#length_9|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2} OutVars{#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_4|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2, #valid=|v_#valid_19|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6, #length=|v_#length_9|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1] [2018-04-05 21:53:32,236 DEBUG L288 ransitionTransformer]: formula has changed [2018-04-05 21:53:32,236 DEBUG L289 ransitionTransformer]: old formula: [2018-04-05 21:53:32,236 DEBUG L290 ransitionTransformer]: (let ((.cse1 (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6))) (let ((.cse0 (+ .cse1 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2))) (and (= (select (select |v_#memory_int_6| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2) .cse0) |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_1|) (= 1 (select |v_#valid_19| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2)) (<= (+ .cse1 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2 4) (select |v_#length_9| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2)) (<= 0 .cse0)))) [2018-04-05 21:53:32,237 DEBUG L291 ransitionTransformer]: new formula: [2018-04-05 21:53:32,237 DEBUG L292 ransitionTransformer]: (let ((.cse1 (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6))) (let ((.cse0 (+ .cse1 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2))) (and (= (select (select |v_#memory_int_part_locs_31_locs_32_4| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2) .cse0) |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_1|) (= 1 (select |v_#valid_19| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2)) (<= (+ .cse1 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2 4) (select |v_#length_9| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2)) (<= 0 .cse0)))) [2018-04-05 21:53:32,237 DEBUG L296 ransitionTransformer]: invars have changed [2018-04-05 21:53:32,237 DEBUG L297 ransitionTransformer]: old invars: [2018-04-05 21:53:32,237 DEBUG L298 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_6|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6, #length=|v_#length_9|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2} [2018-04-05 21:53:32,237 DEBUG L299 ransitionTransformer]: new invars: [2018-04-05 21:53:32,238 DEBUG L300 ransitionTransformer]: {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_4|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2, #valid=|v_#valid_19|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6, #length=|v_#length_9|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2} [2018-04-05 21:53:32,238 DEBUG L304 ransitionTransformer]: outvars have changed [2018-04-05 21:53:32,238 DEBUG L305 ransitionTransformer]: old outvars: [2018-04-05 21:53:32,238 DEBUG L306 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_6|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6, #length=|v_#length_9|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2} [2018-04-05 21:53:32,238 DEBUG L307 ransitionTransformer]: new outvars: [2018-04-05 21:53:32,238 DEBUG L308 ransitionTransformer]: {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_4|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2, #valid=|v_#valid_19|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6, #length=|v_#length_9|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2} [2018-04-05 21:53:32,239 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,239 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,239 DEBUG L281 ransitionTransformer]: Formula: (not (= 1 (select |v_#valid_20| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_3))) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_3, #valid=|v_#valid_20|} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_3, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,239 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,239 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,240 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,240 DEBUG L281 ransitionTransformer]: Formula: (let ((.cse0 (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_7))) (or (not (<= (+ .cse0 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_3 4) (select |v_#length_10| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_4))) (not (<= 0 (+ .cse0 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_3))))) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_7, #length=|v_#length_10|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_4, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_3} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_7, #length=|v_#length_10|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_4, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_3} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,240 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,240 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,241 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,241 DEBUG L281 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0_2 (store v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0_3 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_8 |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_2|)) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_2|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0_3, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_8} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_2|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0_2, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_8} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0] [2018-04-05 21:53:32,241 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,241 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,242 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,242 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_3|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1] [2018-04-05 21:53:32,242 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,242 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,242 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,242 DEBUG L281 ransitionTransformer]: Formula: (= |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0_1| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_9) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_9} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_9} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0] [2018-04-05 21:53:32,242 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,242 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,243 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,243 DEBUG L281 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_10 (+ |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0_2| 1)) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0_2|} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0_2|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_10} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0] [2018-04-05 21:53:32,243 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,243 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,243 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,243 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0_3|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0] [2018-04-05 21:53:32,243 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,243 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,243 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,243 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-05 21:53:32,244 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,244 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,244 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,244 DEBUG L281 ransitionTransformer]: Formula: (= |v_ULTIMATE.start_#t~ret6_2| |v_main_#resOutParam_1|) InVars {main_#res=|v_main_#resOutParam_1|} OutVars{ULTIMATE.start_#t~ret6=|v_ULTIMATE.start_#t~ret6_2|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret6] [2018-04-05 21:53:32,244 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,244 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,244 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-05 21:53:32,244 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#t~ret3_5| |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#resOutParam_1|) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#res=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#resOutParam_1|} OutVars{main_#t~ret3=|v_main_#t~ret3_5|} AuxVars[] AssignedVars[main_#t~ret3] [2018-04-05 21:53:32,244 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-05 21:53:32,244 DEBUG L310 ransitionTransformer]: [2018-04-05 21:53:32,245 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-05 21:53:32,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 09:53:32 BasicIcfg [2018-04-05 21:53:32,246 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-04-05 21:53:32,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-05 21:53:32,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-05 21:53:32,248 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-05 21:53:32,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 09:53:12" (1/4) ... [2018-04-05 21:53:32,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6dfc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 09:53:32, skipping insertion in model container [2018-04-05 21:53:32,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:53:13" (2/4) ... [2018-04-05 21:53:32,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6dfc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 09:53:32, skipping insertion in model container [2018-04-05 21:53:32,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 09:53:13" (3/4) ... [2018-04-05 21:53:32,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6dfc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 09:53:32, skipping insertion in model container [2018-04-05 21:53:32,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 09:53:32" (4/4) ... [2018-04-05 21:53:32,251 INFO L107 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-04-05 21:53:32,257 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-05 21:53:32,263 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-04-05 21:53:32,290 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-05 21:53:32,291 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-05 21:53:32,291 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-05 21:53:32,291 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-05 21:53:32,291 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-05 21:53:32,291 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-05 21:53:32,291 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-05 21:53:32,291 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-05 21:53:32,292 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-05 21:53:32,292 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-05 21:53:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-04-05 21:53:32,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-05 21:53:32,304 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:32,305 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:32,305 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:32,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1794506128, 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-05 21:53:32,321 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:32,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:32,371 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-05 21:53:32,371 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:32,385 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-05 21:53:32,407 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 21:53:32,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-05 21:53:32,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-05 21:53:32,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-05 21:53:32,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-05 21:53:32,418 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-04-05 21:53:32,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:32,436 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-04-05 21:53:32,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-05 21:53:32,437 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-04-05 21:53:32,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:32,445 INFO L225 Difference]: With dead ends: 119 [2018-04-05 21:53:32,445 INFO L226 Difference]: Without dead ends: 61 [2018-04-05 21:53:32,449 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-05 21:53:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-04-05 21:53:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-04-05 21:53:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-05 21:53:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-04-05 21:53:32,477 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 14 [2018-04-05 21:53:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:32,478 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-04-05 21:53:32,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-05 21:53:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-04-05 21:53:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-05 21:53:32,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:32,478 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:32,478 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash -235425509, 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-05 21:53:32,489 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:32,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:32,552 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-05 21:53:32,552 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:32,574 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-05 21:53:32,594 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 21:53:32,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-04-05 21:53:32,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 21:53:32,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 21:53:32,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-05 21:53:32,596 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 4 states. [2018-04-05 21:53:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:32,715 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-04-05 21:53:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 21:53:32,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-05 21:53:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:32,719 INFO L225 Difference]: With dead ends: 108 [2018-04-05 21:53:32,719 INFO L226 Difference]: Without dead ends: 88 [2018-04-05 21:53:32,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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-05 21:53:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-05 21:53:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2018-04-05 21:53:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-05 21:53:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-04-05 21:53:32,732 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 15 [2018-04-05 21:53:32,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:32,733 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-04-05 21:53:32,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 21:53:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-04-05 21:53:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-05 21:53:32,733 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:32,734 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] [2018-04-05 21:53:32,734 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:32,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2036720968, 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-05 21:53:32,749 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:32,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:32,881 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-05 21:53:32,881 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:32,909 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-05 21:53:32,930 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 21:53:32,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2018-04-05 21:53:32,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-05 21:53:32,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-05 21:53:32,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-05 21:53:32,930 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 7 states. [2018-04-05 21:53:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:33,036 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-04-05 21:53:33,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-05 21:53:33,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-05 21:53:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:33,038 INFO L225 Difference]: With dead ends: 151 [2018-04-05 21:53:33,038 INFO L226 Difference]: Without dead ends: 97 [2018-04-05 21:53:33,038 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-04-05 21:53:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-05 21:53:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-04-05 21:53:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-05 21:53:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-04-05 21:53:33,047 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 21 [2018-04-05 21:53:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:33,047 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-04-05 21:53:33,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-05 21:53:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-04-05 21:53:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-05 21:53:33,048 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:33,048 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:33,049 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:33,049 INFO L82 PathProgramCache]: Analyzing trace with hash -595808487, 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-05 21:53:33,056 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:33,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:33,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 21:53:33,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 21:53:33,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 21:53:33,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 21:53:33,106 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-05 21:53:33,106 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:33,112 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-05 21:53:33,141 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 21:53:33,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [] total 3 [2018-04-05 21:53:33,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 21:53:33,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 21:53:33,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-05 21:53:33,142 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 4 states. [2018-04-05 21:53:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:33,198 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-04-05 21:53:33,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 21:53:33,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-05 21:53:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:33,202 INFO L225 Difference]: With dead ends: 77 [2018-04-05 21:53:33,202 INFO L226 Difference]: Without dead ends: 75 [2018-04-05 21:53:33,205 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-05 21:53:33,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-05 21:53:33,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-05 21:53:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-05 21:53:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-04-05 21:53:33,217 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 25 [2018-04-05 21:53:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:33,217 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-04-05 21:53:33,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 21:53:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-04-05 21:53:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-05 21:53:33,218 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:33,219 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:33,219 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:33,219 INFO L82 PathProgramCache]: Analyzing trace with hash -595808486, 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-05 21:53:33,229 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:33,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:33,260 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-05 21:53:33,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 21:53:33,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 21:53:33,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 21:53:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 21:53:33,328 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:33,391 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-05 21:53:33,413 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 21:53:33,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2018-04-05 21:53:33,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 21:53:33,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 21:53:33,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-05 21:53:33,414 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 9 states. [2018-04-05 21:53:33,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:33,519 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-04-05 21:53:33,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 21:53:33,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-04-05 21:53:33,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:33,521 INFO L225 Difference]: With dead ends: 80 [2018-04-05 21:53:33,521 INFO L226 Difference]: Without dead ends: 78 [2018-04-05 21:53:33,521 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-05 21:53:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-05 21:53:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-04-05 21:53:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-05 21:53:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-04-05 21:53:33,529 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 25 [2018-04-05 21:53:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:33,529 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-04-05 21:53:33,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 21:53:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-04-05 21:53:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-05 21:53:33,531 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:33,531 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:33,531 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash 37312857, 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-05 21:53:33,542 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:33,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 21:53:33,630 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 21:53:33,705 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 21:53:33,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2018-04-05 21:53:33,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 21:53:33,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 21:53:33,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-05 21:53:33,705 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-04-05 21:53:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:33,875 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2018-04-05 21:53:33,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-05 21:53:33,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-04-05 21:53:33,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:33,877 INFO L225 Difference]: With dead ends: 107 [2018-04-05 21:53:33,877 INFO L226 Difference]: Without dead ends: 106 [2018-04-05 21:53:33,877 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-04-05 21:53:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-05 21:53:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2018-04-05 21:53:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-05 21:53:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-04-05 21:53:33,884 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 41 [2018-04-05 21:53:33,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:33,884 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-04-05 21:53:33,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 21:53:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-04-05 21:53:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-05 21:53:33,885 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:33,885 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:33,885 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:33,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1522687287, 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-05 21:53:33,892 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:33,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 21:53:33,920 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 21:53:33,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:33,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-05 21:53:33,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-05 21:53:33,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-05 21:53:33,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-05 21:53:33,959 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 8 states. [2018-04-05 21:53:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:34,029 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-04-05 21:53:34,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-05 21:53:34,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-04-05 21:53:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:34,031 INFO L225 Difference]: With dead ends: 131 [2018-04-05 21:53:34,031 INFO L226 Difference]: Without dead ends: 109 [2018-04-05 21:53:34,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 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-05 21:53:34,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-05 21:53:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2018-04-05 21:53:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-05 21:53:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-04-05 21:53:34,039 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 41 [2018-04-05 21:53:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:34,040 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-04-05 21:53:34,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-05 21:53:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-04-05 21:53:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-05 21:53:34,042 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:34,042 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:34,042 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1156698799, 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-05 21:53:34,065 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:34,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:34,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 21:53:34,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 21:53:34,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 21:53:34,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 21:53:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-05 21:53:34,109 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-05 21:53:34,136 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 21:53:34,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2018-04-05 21:53:34,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 21:53:34,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 21:53:34,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-05 21:53:34,137 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 6 states. [2018-04-05 21:53:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:34,166 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-04-05 21:53:34,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 21:53:34,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-04-05 21:53:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:34,167 INFO L225 Difference]: With dead ends: 96 [2018-04-05 21:53:34,167 INFO L226 Difference]: Without dead ends: 95 [2018-04-05 21:53:34,168 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-05 21:53:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-05 21:53:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-04-05 21:53:34,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-05 21:53:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-04-05 21:53:34,174 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 42 [2018-04-05 21:53:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:34,175 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-04-05 21:53:34,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 21:53:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-04-05 21:53:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-05 21:53:34,176 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:34,176 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:34,176 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:34,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1156698800, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:34,182 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:34,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:34,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-05 21:53:34,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 21:53:34,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 21:53:34,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 21:53:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-05 21:53:34,251 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-05 21:53:34,318 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 21:53:34,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2018-04-05 21:53:34,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-05 21:53:34,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-05 21:53:34,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-04-05 21:53:34,320 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 11 states. [2018-04-05 21:53:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:34,401 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-04-05 21:53:34,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-05 21:53:34,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-05 21:53:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:34,403 INFO L225 Difference]: With dead ends: 104 [2018-04-05 21:53:34,403 INFO L226 Difference]: Without dead ends: 103 [2018-04-05 21:53:34,403 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-04-05 21:53:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-05 21:53:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2018-04-05 21:53:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-05 21:53:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-04-05 21:53:34,411 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 42 [2018-04-05 21:53:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:34,412 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-04-05 21:53:34,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-05 21:53:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-04-05 21:53:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-05 21:53:34,413 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:34,413 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:34,413 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:34,413 INFO L82 PathProgramCache]: Analyzing trace with hash 660976299, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:34,418 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:34,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-05 21:53:34,458 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-05 21:53:34,525 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 21:53:34,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2018-04-05 21:53:34,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-05 21:53:34,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-05 21:53:34,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-05 21:53:34,526 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 10 states. [2018-04-05 21:53:34,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:34,629 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2018-04-05 21:53:34,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-05 21:53:34,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-04-05 21:53:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:34,630 INFO L225 Difference]: With dead ends: 179 [2018-04-05 21:53:34,630 INFO L226 Difference]: Without dead ends: 112 [2018-04-05 21:53:34,630 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-04-05 21:53:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-05 21:53:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-04-05 21:53:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-05 21:53:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-04-05 21:53:34,637 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 45 [2018-04-05 21:53:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:34,638 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-04-05 21:53:34,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-05 21:53:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-04-05 21:53:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-05 21:53:34,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:34,639 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:34,639 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:34,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1642959647, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:34,649 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:34,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 21:53:34,728 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 21:53:34,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:34,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-04-05 21:53:34,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-05 21:53:34,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-05 21:53:34,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-05 21:53:34,793 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 13 states. [2018-04-05 21:53:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:34,948 INFO L93 Difference]: Finished difference Result 191 states and 200 transitions. [2018-04-05 21:53:34,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-05 21:53:34,948 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-04-05 21:53:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:34,949 INFO L225 Difference]: With dead ends: 191 [2018-04-05 21:53:34,950 INFO L226 Difference]: Without dead ends: 127 [2018-04-05 21:53:34,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-04-05 21:53:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-05 21:53:34,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2018-04-05 21:53:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-05 21:53:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-04-05 21:53:34,959 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 50 [2018-04-05 21:53:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:34,959 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-04-05 21:53:34,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-05 21:53:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-04-05 21:53:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-05 21:53:34,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:34,961 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:34,961 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:34,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1106887219, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:34,969 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:34,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:34,995 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-05 21:53:34,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 21:53:35,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 21:53:35,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 21:53:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-05 21:53:35,077 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-05 21:53:35,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:35,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-04-05 21:53:35,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-05 21:53:35,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-05 21:53:35,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-04-05 21:53:35,195 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 11 states. [2018-04-05 21:53:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:35,376 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-04-05 21:53:35,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 21:53:35,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-04-05 21:53:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:35,377 INFO L225 Difference]: With dead ends: 128 [2018-04-05 21:53:35,377 INFO L226 Difference]: Without dead ends: 127 [2018-04-05 21:53:35,378 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2018-04-05 21:53:35,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-05 21:53:35,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-04-05 21:53:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-05 21:53:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-04-05 21:53:35,384 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 54 [2018-04-05 21:53:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:35,384 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-04-05 21:53:35,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-05 21:53:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-04-05 21:53:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-05 21:53:35,385 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:35,385 INFO L355 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:35,385 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:35,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1097213976, now seen corresponding path program 2 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-05 21:53:35,390 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:35,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-05 21:53:35,484 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-05 21:53:35,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:35,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-04-05 21:53:35,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-05 21:53:35,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-05 21:53:35,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-04-05 21:53:35,565 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 15 states. [2018-04-05 21:53:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:35,839 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-04-05 21:53:35,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-05 21:53:35,839 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2018-04-05 21:53:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:35,840 INFO L225 Difference]: With dead ends: 149 [2018-04-05 21:53:35,840 INFO L226 Difference]: Without dead ends: 148 [2018-04-05 21:53:35,841 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 139 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-04-05 21:53:35,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-05 21:53:35,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2018-04-05 21:53:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-05 21:53:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2018-04-05 21:53:35,851 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 79 [2018-04-05 21:53:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:35,851 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2018-04-05 21:53:35,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-05 21:53:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2018-04-05 21:53:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-05 21:53:35,853 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:35,853 INFO L355 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:35,853 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:35,853 INFO L82 PathProgramCache]: Analyzing trace with hash 346105345, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:35,863 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:35,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:35,909 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-05 21:53:35,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 21:53:35,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 21:53:35,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 21:53:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-04-05 21:53:36,009 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-04-05 21:53:36,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:36,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-04-05 21:53:36,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-05 21:53:36,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-05 21:53:36,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-04-05 21:53:36,173 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 15 states. [2018-04-05 21:53:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:36,424 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-04-05 21:53:36,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-05 21:53:36,424 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 80 [2018-04-05 21:53:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:36,426 INFO L225 Difference]: With dead ends: 145 [2018-04-05 21:53:36,426 INFO L226 Difference]: Without dead ends: 144 [2018-04-05 21:53:36,426 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2018-04-05 21:53:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-05 21:53:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2018-04-05 21:53:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-05 21:53:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-04-05 21:53:36,435 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 80 [2018-04-05 21:53:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:36,435 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-04-05 21:53:36,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-05 21:53:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-04-05 21:53:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-05 21:53:36,436 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:36,437 INFO L355 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:36,437 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:36,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1751506738, now seen corresponding path program 3 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-05 21:53:36,443 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:36,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-05 21:53:36,606 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-05 21:53:36,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:36,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-04-05 21:53:36,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-05 21:53:36,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-05 21:53:36,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-04-05 21:53:36,697 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 19 states. [2018-04-05 21:53:36,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:36,926 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2018-04-05 21:53:36,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-05 21:53:36,927 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 88 [2018-04-05 21:53:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:36,928 INFO L225 Difference]: With dead ends: 258 [2018-04-05 21:53:36,928 INFO L226 Difference]: Without dead ends: 182 [2018-04-05 21:53:36,929 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 151 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2018-04-05 21:53:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-05 21:53:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 166. [2018-04-05 21:53:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-05 21:53:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2018-04-05 21:53:36,938 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 88 [2018-04-05 21:53:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:36,938 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2018-04-05 21:53:36,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-05 21:53:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2018-04-05 21:53:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-05 21:53:36,940 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:36,940 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:36,940 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:36,940 INFO L82 PathProgramCache]: Analyzing trace with hash -895613591, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:36,946 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:36,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-05 21:53:37,028 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-05 21:53:37,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:37,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-04-05 21:53:37,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-05 21:53:37,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-05 21:53:37,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-04-05 21:53:37,164 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand 16 states. [2018-04-05 21:53:37,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:37,418 INFO L93 Difference]: Finished difference Result 260 states and 272 transitions. [2018-04-05 21:53:37,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-05 21:53:37,419 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2018-04-05 21:53:37,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:37,420 INFO L225 Difference]: With dead ends: 260 [2018-04-05 21:53:37,420 INFO L226 Difference]: Without dead ends: 178 [2018-04-05 21:53:37,421 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 177 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-04-05 21:53:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-05 21:53:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2018-04-05 21:53:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-05 21:53:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 171 transitions. [2018-04-05 21:53:37,430 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 171 transitions. Word has length 99 [2018-04-05 21:53:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:37,431 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 171 transitions. [2018-04-05 21:53:37,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-05 21:53:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 171 transitions. [2018-04-05 21:53:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-04-05 21:53:37,432 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:37,432 INFO L355 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:37,432 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1767343027, now seen corresponding path program 2 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-05 21:53:37,441 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:37,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-05 21:53:37,503 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-05 21:53:37,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:37,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-05 21:53:37,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-05 21:53:37,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-05 21:53:37,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-04-05 21:53:37,587 INFO L87 Difference]: Start difference. First operand 166 states and 171 transitions. Second operand 16 states. [2018-04-05 21:53:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:37,747 INFO L93 Difference]: Finished difference Result 236 states and 248 transitions. [2018-04-05 21:53:37,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-05 21:53:37,748 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2018-04-05 21:53:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:37,749 INFO L225 Difference]: With dead ends: 236 [2018-04-05 21:53:37,749 INFO L226 Difference]: Without dead ends: 214 [2018-04-05 21:53:37,750 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=259, Invalid=497, Unknown=0, NotChecked=0, Total=756 [2018-04-05 21:53:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-05 21:53:37,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 199. [2018-04-05 21:53:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-05 21:53:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 210 transitions. [2018-04-05 21:53:37,762 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 210 transitions. Word has length 108 [2018-04-05 21:53:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:37,762 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 210 transitions. [2018-04-05 21:53:37,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-05 21:53:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 210 transitions. [2018-04-05 21:53:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-04-05 21:53:37,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:37,763 INFO L355 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:37,763 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:37,763 INFO L82 PathProgramCache]: Analyzing trace with hash -471724861, now seen corresponding path program 4 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-05 21:53:37,771 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:37,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 135 proven. 15 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-05 21:53:37,898 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 135 proven. 15 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-05 21:53:38,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:38,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2018-04-05 21:53:38,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-05 21:53:38,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-05 21:53:38,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-04-05 21:53:38,016 INFO L87 Difference]: Start difference. First operand 199 states and 210 transitions. Second operand 21 states. [2018-04-05 21:53:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:38,396 INFO L93 Difference]: Finished difference Result 219 states and 231 transitions. [2018-04-05 21:53:38,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-05 21:53:38,397 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 126 [2018-04-05 21:53:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:38,399 INFO L225 Difference]: With dead ends: 219 [2018-04-05 21:53:38,399 INFO L226 Difference]: Without dead ends: 218 [2018-04-05 21:53:38,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 224 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2018-04-05 21:53:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-05 21:53:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 199. [2018-04-05 21:53:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-05 21:53:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 209 transitions. [2018-04-05 21:53:38,412 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 209 transitions. Word has length 126 [2018-04-05 21:53:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:38,412 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 209 transitions. [2018-04-05 21:53:38,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-05 21:53:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 209 transitions. [2018-04-05 21:53:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-04-05 21:53:38,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:38,414 INFO L355 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:38,414 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:38,414 INFO L82 PathProgramCache]: Analyzing trace with hash -716005099, now seen corresponding path program 2 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-05 21:53:38,423 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:38,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 138 proven. 13 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-04-05 21:53:38,578 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 138 proven. 13 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-04-05 21:53:38,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:38,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2018-04-05 21:53:38,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-05 21:53:38,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-05 21:53:38,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-04-05 21:53:38,761 INFO L87 Difference]: Start difference. First operand 199 states and 209 transitions. Second operand 22 states. [2018-04-05 21:53:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:39,049 INFO L93 Difference]: Finished difference Result 318 states and 339 transitions. [2018-04-05 21:53:39,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-05 21:53:39,049 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 130 [2018-04-05 21:53:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:39,050 INFO L225 Difference]: With dead ends: 318 [2018-04-05 21:53:39,050 INFO L226 Difference]: Without dead ends: 215 [2018-04-05 21:53:39,051 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 231 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=1018, Unknown=0, NotChecked=0, Total=1260 [2018-04-05 21:53:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-05 21:53:39,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 199. [2018-04-05 21:53:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-05 21:53:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 208 transitions. [2018-04-05 21:53:39,058 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 208 transitions. Word has length 130 [2018-04-05 21:53:39,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:39,058 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 208 transitions. [2018-04-05 21:53:39,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-05 21:53:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 208 transitions. [2018-04-05 21:53:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-04-05 21:53:39,059 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:39,059 INFO L355 BasicCegarLoop]: trace histogram [10, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:39,059 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:39,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1712590665, now seen corresponding path program 5 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-05 21:53:39,068 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:39,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-05 21:53:39,223 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-05 21:53:39,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:39,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2018-04-05 21:53:39,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-05 21:53:39,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-05 21:53:39,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-04-05 21:53:39,369 INFO L87 Difference]: Start difference. First operand 199 states and 208 transitions. Second operand 25 states. [2018-04-05 21:53:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:40,064 INFO L93 Difference]: Finished difference Result 348 states and 365 transitions. [2018-04-05 21:53:40,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-05 21:53:40,065 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 135 [2018-04-05 21:53:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:40,066 INFO L225 Difference]: With dead ends: 348 [2018-04-05 21:53:40,066 INFO L226 Difference]: Without dead ends: 248 [2018-04-05 21:53:40,067 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 237 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=363, Invalid=1617, Unknown=0, NotChecked=0, Total=1980 [2018-04-05 21:53:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-05 21:53:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 237. [2018-04-05 21:53:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-05 21:53:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 245 transitions. [2018-04-05 21:53:40,100 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 245 transitions. Word has length 135 [2018-04-05 21:53:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:40,100 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 245 transitions. [2018-04-05 21:53:40,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-05 21:53:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 245 transitions. [2018-04-05 21:53:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-04-05 21:53:40,101 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:40,101 INFO L355 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:40,101 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash -350131447, now seen corresponding path program 3 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-05 21:53:40,112 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:40,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:40,163 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-05 21:53:40,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 21:53:40,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 21:53:40,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 21:53:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-04-05 21:53:40,454 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-04-05 21:53:40,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:40,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-04-05 21:53:40,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-05 21:53:40,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-05 21:53:40,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-04-05 21:53:40,651 INFO L87 Difference]: Start difference. First operand 237 states and 245 transitions. Second operand 19 states. [2018-04-05 21:53:41,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:41,122 INFO L93 Difference]: Finished difference Result 249 states and 259 transitions. [2018-04-05 21:53:41,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-05 21:53:41,122 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 139 [2018-04-05 21:53:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:41,124 INFO L225 Difference]: With dead ends: 249 [2018-04-05 21:53:41,124 INFO L226 Difference]: Without dead ends: 248 [2018-04-05 21:53:41,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 253 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=783, Unknown=0, NotChecked=0, Total=1122 [2018-04-05 21:53:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-05 21:53:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 240. [2018-04-05 21:53:41,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-04-05 21:53:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 246 transitions. [2018-04-05 21:53:41,139 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 246 transitions. Word has length 139 [2018-04-05 21:53:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:41,139 INFO L459 AbstractCegarLoop]: Abstraction has 240 states and 246 transitions. [2018-04-05 21:53:41,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-05 21:53:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 246 transitions. [2018-04-05 21:53:41,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-04-05 21:53:41,141 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:41,141 INFO L355 BasicCegarLoop]: trace histogram [14, 10, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:41,141 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:41,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2125191314, 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-05 21:53:41,150 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:41,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 302 proven. 36 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-04-05 21:53:41,404 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 302 proven. 36 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-04-05 21:53:41,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:41,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 26 [2018-04-05 21:53:41,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-05 21:53:41,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-05 21:53:41,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-04-05 21:53:41,628 INFO L87 Difference]: Start difference. First operand 240 states and 246 transitions. Second operand 27 states. [2018-04-05 21:53:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:42,074 INFO L93 Difference]: Finished difference Result 270 states and 279 transitions. [2018-04-05 21:53:42,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-05 21:53:42,075 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 182 [2018-04-05 21:53:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:42,077 INFO L225 Difference]: With dead ends: 270 [2018-04-05 21:53:42,077 INFO L226 Difference]: Without dead ends: 269 [2018-04-05 21:53:42,078 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 329 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=1779, Unknown=0, NotChecked=0, Total=2070 [2018-04-05 21:53:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-05 21:53:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 248. [2018-04-05 21:53:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-05 21:53:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 255 transitions. [2018-04-05 21:53:42,093 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 255 transitions. Word has length 182 [2018-04-05 21:53:42,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:42,094 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 255 transitions. [2018-04-05 21:53:42,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-05 21:53:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 255 transitions. [2018-04-05 21:53:42,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-04-05 21:53:42,095 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:42,096 INFO L355 BasicCegarLoop]: trace histogram [14, 10, 10, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:42,096 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:42,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1456421527, now seen corresponding path program 2 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-05 21:53:42,104 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:42,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:42,187 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-05 21:53:42,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 21:53:42,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 21:53:42,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 21:53:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 242 proven. 39 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-04-05 21:53:42,386 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 242 proven. 39 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-04-05 21:53:42,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:42,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-05 21:53:42,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-05 21:53:42,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-05 21:53:42,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-04-05 21:53:42,566 INFO L87 Difference]: Start difference. First operand 248 states and 255 transitions. Second operand 23 states. [2018-04-05 21:53:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:43,428 INFO L93 Difference]: Finished difference Result 292 states and 317 transitions. [2018-04-05 21:53:43,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-05 21:53:43,428 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 183 [2018-04-05 21:53:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:43,430 INFO L225 Difference]: With dead ends: 292 [2018-04-05 21:53:43,430 INFO L226 Difference]: Without dead ends: 291 [2018-04-05 21:53:43,431 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 341 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=462, Invalid=1344, Unknown=0, NotChecked=0, Total=1806 [2018-04-05 21:53:43,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-04-05 21:53:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 276. [2018-04-05 21:53:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-05 21:53:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 289 transitions. [2018-04-05 21:53:43,447 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 289 transitions. Word has length 183 [2018-04-05 21:53:43,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:43,448 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 289 transitions. [2018-04-05 21:53:43,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-05 21:53:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 289 transitions. [2018-04-05 21:53:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-04-05 21:53:43,449 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:43,450 INFO L355 BasicCegarLoop]: trace histogram [15, 11, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:43,450 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:43,450 INFO L82 PathProgramCache]: Analyzing trace with hash -715588152, now seen corresponding path program 7 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-05 21:53:43,455 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:43,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 364 proven. 66 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-04-05 21:53:43,635 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 364 proven. 66 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-04-05 21:53:43,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:43,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 31 [2018-04-05 21:53:43,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-05 21:53:43,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-05 21:53:43,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2018-04-05 21:53:43,817 INFO L87 Difference]: Start difference. First operand 276 states and 289 transitions. Second operand 31 states. [2018-04-05 21:53:44,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:44,401 INFO L93 Difference]: Finished difference Result 466 states and 493 transitions. [2018-04-05 21:53:44,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-05 21:53:44,402 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 191 [2018-04-05 21:53:44,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:44,403 INFO L225 Difference]: With dead ends: 466 [2018-04-05 21:53:44,403 INFO L226 Difference]: Without dead ends: 336 [2018-04-05 21:53:44,405 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 341 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=552, Invalid=2640, Unknown=0, NotChecked=0, Total=3192 [2018-04-05 21:53:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-04-05 21:53:44,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 323. [2018-04-05 21:53:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-05 21:53:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 336 transitions. [2018-04-05 21:53:44,423 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 336 transitions. Word has length 191 [2018-04-05 21:53:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:44,424 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 336 transitions. [2018-04-05 21:53:44,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-05 21:53:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 336 transitions. [2018-04-05 21:53:44,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-04-05 21:53:44,425 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:44,426 INFO L355 BasicCegarLoop]: trace histogram [19, 14, 13, 13, 13, 13, 13, 13, 13, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:44,426 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:44,426 INFO L82 PathProgramCache]: Analyzing trace with hash 719034531, now seen corresponding path program 8 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-05 21:53:44,435 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:44,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 766 proven. 33 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2018-04-05 21:53:44,629 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 766 proven. 33 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2018-04-05 21:53:44,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:44,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-04-05 21:53:44,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-05 21:53:44,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-05 21:53:44,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-04-05 21:53:44,849 INFO L87 Difference]: Start difference. First operand 323 states and 336 transitions. Second operand 28 states. [2018-04-05 21:53:45,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:45,220 INFO L93 Difference]: Finished difference Result 471 states and 497 transitions. [2018-04-05 21:53:45,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-05 21:53:45,220 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 238 [2018-04-05 21:53:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:45,222 INFO L225 Difference]: With dead ends: 471 [2018-04-05 21:53:45,222 INFO L226 Difference]: Without dead ends: 335 [2018-04-05 21:53:45,223 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 439 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=390, Invalid=1772, Unknown=0, NotChecked=0, Total=2162 [2018-04-05 21:53:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-05 21:53:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 323. [2018-04-05 21:53:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-05 21:53:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 334 transitions. [2018-04-05 21:53:45,234 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 334 transitions. Word has length 238 [2018-04-05 21:53:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:45,235 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 334 transitions. [2018-04-05 21:53:45,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-05 21:53:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 334 transitions. [2018-04-05 21:53:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-05 21:53:45,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:45,236 INFO L355 BasicCegarLoop]: trace histogram [20, 15, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:45,236 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:45,236 INFO L82 PathProgramCache]: Analyzing trace with hash -384850983, now seen corresponding path program 9 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-05 21:53:45,243 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:45,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 575 proven. 66 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-04-05 21:53:45,527 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 575 proven. 66 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-04-05 21:53:45,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:45,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 32 [2018-04-05 21:53:45,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-05 21:53:45,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-05 21:53:45,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2018-04-05 21:53:45,823 INFO L87 Difference]: Start difference. First operand 323 states and 334 transitions. Second operand 33 states. [2018-04-05 21:53:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:46,437 INFO L93 Difference]: Finished difference Result 339 states and 350 transitions. [2018-04-05 21:53:46,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-05 21:53:46,437 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 247 [2018-04-05 21:53:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:46,439 INFO L225 Difference]: With dead ends: 339 [2018-04-05 21:53:46,439 INFO L226 Difference]: Without dead ends: 338 [2018-04-05 21:53:46,440 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 450 SyntacticMatches, 13 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=409, Invalid=2783, Unknown=0, NotChecked=0, Total=3192 [2018-04-05 21:53:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-05 21:53:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 323. [2018-04-05 21:53:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-05 21:53:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 333 transitions. [2018-04-05 21:53:46,458 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 333 transitions. Word has length 247 [2018-04-05 21:53:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:46,459 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 333 transitions. [2018-04-05 21:53:46,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-05 21:53:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 333 transitions. [2018-04-05 21:53:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-04-05 21:53:46,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:46,461 INFO L355 BasicCegarLoop]: trace histogram [21, 16, 15, 15, 15, 15, 15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:46,461 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:46,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1734865505, now seen corresponding path program 10 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-05 21:53:46,467 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:46,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 675 proven. 105 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-04-05 21:53:46,966 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 675 proven. 105 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-04-05 21:53:47,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:47,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 37 [2018-04-05 21:53:47,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-05 21:53:47,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-05 21:53:47,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2018-04-05 21:53:47,361 INFO L87 Difference]: Start difference. First operand 323 states and 333 transitions. Second operand 37 states. [2018-04-05 21:53:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:47,979 INFO L93 Difference]: Finished difference Result 513 states and 534 transitions. [2018-04-05 21:53:47,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-05 21:53:47,979 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 256 [2018-04-05 21:53:47,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:47,981 INFO L225 Difference]: With dead ends: 513 [2018-04-05 21:53:47,982 INFO L226 Difference]: Without dead ends: 392 [2018-04-05 21:53:47,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 463 SyntacticMatches, 13 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=779, Invalid=3913, Unknown=0, NotChecked=0, Total=4692 [2018-04-05 21:53:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-05 21:53:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 379. [2018-04-05 21:53:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-04-05 21:53:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 389 transitions. [2018-04-05 21:53:48,001 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 389 transitions. Word has length 256 [2018-04-05 21:53:48,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:48,001 INFO L459 AbstractCegarLoop]: Abstraction has 379 states and 389 transitions. [2018-04-05 21:53:48,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-05 21:53:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 389 transitions. [2018-04-05 21:53:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-05 21:53:48,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:48,003 INFO L355 BasicCegarLoop]: trace histogram [26, 20, 19, 19, 19, 19, 19, 19, 19, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:48,003 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:48,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1507726960, now seen corresponding path program 11 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-05 21:53:48,008 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:48,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 1393 proven. 62 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-04-05 21:53:48,565 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 1393 proven. 62 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-04-05 21:53:48,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:48,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 34 [2018-04-05 21:53:48,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-05 21:53:48,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-05 21:53:48,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2018-04-05 21:53:48,928 INFO L87 Difference]: Start difference. First operand 379 states and 389 transitions. Second operand 34 states. [2018-04-05 21:53:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:49,442 INFO L93 Difference]: Finished difference Result 518 states and 537 transitions. [2018-04-05 21:53:49,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-05 21:53:49,442 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 312 [2018-04-05 21:53:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:49,444 INFO L225 Difference]: With dead ends: 518 [2018-04-05 21:53:49,444 INFO L226 Difference]: Without dead ends: 391 [2018-04-05 21:53:49,445 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 579 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=572, Invalid=2734, Unknown=0, NotChecked=0, Total=3306 [2018-04-05 21:53:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-04-05 21:53:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 379. [2018-04-05 21:53:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-04-05 21:53:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 387 transitions. [2018-04-05 21:53:49,463 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 387 transitions. Word has length 312 [2018-04-05 21:53:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:49,464 INFO L459 AbstractCegarLoop]: Abstraction has 379 states and 387 transitions. [2018-04-05 21:53:49,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-05 21:53:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 387 transitions. [2018-04-05 21:53:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-04-05 21:53:49,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:49,466 INFO L355 BasicCegarLoop]: trace histogram [27, 21, 20, 20, 20, 20, 20, 20, 20, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:49,466 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:49,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1262475496, now seen corresponding path program 12 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:49,473 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:49,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2376 backedges. 981 proven. 105 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2018-04-05 21:53:49,779 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:50,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2376 backedges. 981 proven. 105 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2018-04-05 21:53:50,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:50,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 38 [2018-04-05 21:53:50,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-05 21:53:50,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-05 21:53:50,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1324, Unknown=0, NotChecked=0, Total=1482 [2018-04-05 21:53:50,098 INFO L87 Difference]: Start difference. First operand 379 states and 387 transitions. Second operand 39 states. [2018-04-05 21:53:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:50,966 INFO L93 Difference]: Finished difference Result 395 states and 402 transitions. [2018-04-05 21:53:50,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-05 21:53:50,966 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 321 [2018-04-05 21:53:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:50,968 INFO L225 Difference]: With dead ends: 395 [2018-04-05 21:53:50,968 INFO L226 Difference]: Without dead ends: 394 [2018-04-05 21:53:50,969 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 590 SyntacticMatches, 15 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=544, Invalid=4012, Unknown=0, NotChecked=0, Total=4556 [2018-04-05 21:53:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-05 21:53:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 379. [2018-04-05 21:53:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-04-05 21:53:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 386 transitions. [2018-04-05 21:53:50,988 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 386 transitions. Word has length 321 [2018-04-05 21:53:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:50,988 INFO L459 AbstractCegarLoop]: Abstraction has 379 states and 386 transitions. [2018-04-05 21:53:50,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-05 21:53:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 386 transitions. [2018-04-05 21:53:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-04-05 21:53:50,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:50,990 INFO L355 BasicCegarLoop]: trace histogram [28, 22, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:50,990 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:50,990 INFO L82 PathProgramCache]: Analyzing trace with hash -983502, now seen corresponding path program 13 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:50,998 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:51,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2571 backedges. 1128 proven. 153 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2018-04-05 21:53:51,380 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2571 backedges. 1128 proven. 153 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2018-04-05 21:53:51,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:51,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 43 [2018-04-05 21:53:51,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-05 21:53:51,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-05 21:53:51,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1553, Unknown=0, NotChecked=0, Total=1806 [2018-04-05 21:53:51,710 INFO L87 Difference]: Start difference. First operand 379 states and 386 transitions. Second operand 43 states. [2018-04-05 21:53:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:52,561 INFO L93 Difference]: Finished difference Result 572 states and 587 transitions. [2018-04-05 21:53:52,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-05 21:53:52,596 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 330 [2018-04-05 21:53:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:52,598 INFO L225 Difference]: With dead ends: 572 [2018-04-05 21:53:52,598 INFO L226 Difference]: Without dead ends: 460 [2018-04-05 21:53:52,600 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 603 SyntacticMatches, 15 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1044, Invalid=5436, Unknown=0, NotChecked=0, Total=6480 [2018-04-05 21:53:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-04-05 21:53:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 444. [2018-04-05 21:53:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-04-05 21:53:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 451 transitions. [2018-04-05 21:53:52,623 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 451 transitions. Word has length 330 [2018-04-05 21:53:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:52,624 INFO L459 AbstractCegarLoop]: Abstraction has 444 states and 451 transitions. [2018-04-05 21:53:52,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-05 21:53:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 451 transitions. [2018-04-05 21:53:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-04-05 21:53:52,626 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:52,626 INFO L355 BasicCegarLoop]: trace histogram [27, 20, 20, 20, 20, 20, 20, 20, 20, 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] [2018-04-05 21:53:52,627 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:52,627 INFO L82 PathProgramCache]: Analyzing trace with hash 557418089, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:52,634 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:52,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2424 backedges. 1016 proven. 100 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2018-04-05 21:53:53,039 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2424 backedges. 1016 proven. 100 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2018-04-05 21:53:53,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:53,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 40 [2018-04-05 21:53:53,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-05 21:53:53,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-05 21:53:53,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1326, Unknown=0, NotChecked=0, Total=1560 [2018-04-05 21:53:53,623 INFO L87 Difference]: Start difference. First operand 444 states and 451 transitions. Second operand 40 states. [2018-04-05 21:53:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:54,179 INFO L93 Difference]: Finished difference Result 574 states and 586 transitions. [2018-04-05 21:53:54,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-05 21:53:54,179 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 341 [2018-04-05 21:53:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:54,181 INFO L225 Difference]: With dead ends: 574 [2018-04-05 21:53:54,181 INFO L226 Difference]: Without dead ends: 456 [2018-04-05 21:53:54,182 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 629 SyntacticMatches, 15 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=788, Invalid=3904, Unknown=0, NotChecked=0, Total=4692 [2018-04-05 21:53:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-05 21:53:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 444. [2018-04-05 21:53:54,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-04-05 21:53:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 449 transitions. [2018-04-05 21:53:54,204 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 449 transitions. Word has length 341 [2018-04-05 21:53:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:54,205 INFO L459 AbstractCegarLoop]: Abstraction has 444 states and 449 transitions. [2018-04-05 21:53:54,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-05 21:53:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 449 transitions. [2018-04-05 21:53:54,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-04-05 21:53:54,207 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:54,208 INFO L355 BasicCegarLoop]: trace histogram [28, 21, 21, 21, 21, 21, 21, 21, 21, 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] [2018-04-05 21:53:54,208 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:54,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1394418355, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:54,216 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:54,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2618 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-04-05 21:53:54,475 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2618 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-04-05 21:53:54,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:54,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-05 21:53:54,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-05 21:53:54,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-05 21:53:54,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2018-04-05 21:53:54,688 INFO L87 Difference]: Start difference. First operand 444 states and 449 transitions. Second operand 32 states. [2018-04-05 21:53:55,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:55,094 INFO L93 Difference]: Finished difference Result 554 states and 574 transitions. [2018-04-05 21:53:55,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-05 21:53:55,094 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 350 [2018-04-05 21:53:55,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:55,096 INFO L225 Difference]: With dead ends: 554 [2018-04-05 21:53:55,096 INFO L226 Difference]: Without dead ends: 532 [2018-04-05 21:53:55,097 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1155, Invalid=2385, Unknown=0, NotChecked=0, Total=3540 [2018-04-05 21:53:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-04-05 21:53:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 513. [2018-04-05 21:53:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-05 21:53:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 532 transitions. [2018-04-05 21:53:55,124 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 532 transitions. Word has length 350 [2018-04-05 21:53:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:55,124 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 532 transitions. [2018-04-05 21:53:55,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-05 21:53:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 532 transitions. [2018-04-05 21:53:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-04-05 21:53:55,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:55,128 INFO L355 BasicCegarLoop]: trace histogram [35, 28, 27, 27, 27, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:55,128 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:55,128 INFO L82 PathProgramCache]: Analyzing trace with hash 641806531, now seen corresponding path program 14 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:55,137 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:55,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4115 backedges. 1547 proven. 153 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-04-05 21:53:55,714 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4115 backedges. 1547 proven. 153 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-04-05 21:53:56,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:56,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 44 [2018-04-05 21:53:56,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-05 21:53:56,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-05 21:53:56,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1782, Unknown=0, NotChecked=0, Total=1980 [2018-04-05 21:53:56,117 INFO L87 Difference]: Start difference. First operand 513 states and 532 transitions. Second operand 45 states. [2018-04-05 21:53:57,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:57,207 INFO L93 Difference]: Finished difference Result 533 states and 557 transitions. [2018-04-05 21:53:57,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-05 21:53:57,207 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 404 [2018-04-05 21:53:57,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:57,209 INFO L225 Difference]: With dead ends: 533 [2018-04-05 21:53:57,209 INFO L226 Difference]: Without dead ends: 532 [2018-04-05 21:53:57,210 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 748 SyntacticMatches, 17 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1785 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=696, Invalid=5466, Unknown=0, NotChecked=0, Total=6162 [2018-04-05 21:53:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-04-05 21:53:57,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 513. [2018-04-05 21:53:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-05 21:53:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 531 transitions. [2018-04-05 21:53:57,226 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 531 transitions. Word has length 404 [2018-04-05 21:53:57,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:57,226 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 531 transitions. [2018-04-05 21:53:57,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-05 21:53:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 531 transitions. [2018-04-05 21:53:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-04-05 21:53:57,229 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:57,229 INFO L355 BasicCegarLoop]: trace histogram [35, 27, 27, 27, 27, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:57,229 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:57,229 INFO L82 PathProgramCache]: Analyzing trace with hash -880818923, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:57,241 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:57,333 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:53:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 1540 proven. 147 refuted. 0 times theorem prover too weak. 2436 trivial. 0 not checked. [2018-04-05 21:53:58,280 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:53:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 1540 proven. 147 refuted. 0 times theorem prover too weak. 2436 trivial. 0 not checked. [2018-04-05 21:53:58,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:53:58,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 46 [2018-04-05 21:53:58,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-05 21:53:58,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-05 21:53:58,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1770, Unknown=0, NotChecked=0, Total=2070 [2018-04-05 21:53:58,742 INFO L87 Difference]: Start difference. First operand 513 states and 531 transitions. Second operand 46 states. [2018-04-05 21:53:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:53:59,386 INFO L93 Difference]: Finished difference Result 704 states and 745 transitions. [2018-04-05 21:53:59,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-05 21:53:59,387 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 408 [2018-04-05 21:53:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:53:59,388 INFO L225 Difference]: With dead ends: 704 [2018-04-05 21:53:59,388 INFO L226 Difference]: Without dead ends: 529 [2018-04-05 21:53:59,389 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 755 SyntacticMatches, 17 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2266 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1038, Invalid=5282, Unknown=0, NotChecked=0, Total=6320 [2018-04-05 21:53:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-04-05 21:53:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 513. [2018-04-05 21:53:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-05 21:53:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 530 transitions. [2018-04-05 21:53:59,405 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 530 transitions. Word has length 408 [2018-04-05 21:53:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:53:59,405 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 530 transitions. [2018-04-05 21:53:59,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-05 21:53:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 530 transitions. [2018-04-05 21:53:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-04-05 21:53:59,408 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:53:59,408 INFO L355 BasicCegarLoop]: trace histogram [36, 29, 28, 28, 28, 28, 28, 28, 28, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:53:59,408 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:53:59,409 INFO L82 PathProgramCache]: Analyzing trace with hash -430617417, now seen corresponding path program 15 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:53:59,430 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:53:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:53:59,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 1750 proven. 210 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-04-05 21:54:00,059 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 1750 proven. 210 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-04-05 21:54:00,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:00,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 49 [2018-04-05 21:54:00,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-05 21:54:00,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-05 21:54:00,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=2031, Unknown=0, NotChecked=0, Total=2352 [2018-04-05 21:54:00,466 INFO L87 Difference]: Start difference. First operand 513 states and 530 transitions. Second operand 49 states. [2018-04-05 21:54:01,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:01,473 INFO L93 Difference]: Finished difference Result 770 states and 803 transitions. [2018-04-05 21:54:01,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-05 21:54:01,473 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 413 [2018-04-05 21:54:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:01,475 INFO L225 Difference]: With dead ends: 770 [2018-04-05 21:54:01,476 INFO L226 Difference]: Without dead ends: 598 [2018-04-05 21:54:01,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 761 SyntacticMatches, 17 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1347, Invalid=7209, Unknown=0, NotChecked=0, Total=8556 [2018-04-05 21:54:01,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-04-05 21:54:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 587. [2018-04-05 21:54:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-04-05 21:54:01,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 603 transitions. [2018-04-05 21:54:01,504 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 603 transitions. Word has length 413 [2018-04-05 21:54:01,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:01,504 INFO L459 AbstractCegarLoop]: Abstraction has 587 states and 603 transitions. [2018-04-05 21:54:01,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-05 21:54:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 603 transitions. [2018-04-05 21:54:01,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-04-05 21:54:01,506 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:01,506 INFO L355 BasicCegarLoop]: trace histogram [36, 28, 28, 28, 28, 28, 28, 28, 28, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:01,506 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:01,506 INFO L82 PathProgramCache]: Analyzing trace with hash -344144119, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:01,511 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:01,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:01,587 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-05 21:54:01,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 21:54:01,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 21:54:01,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 21:54:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4382 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-04-05 21:54:02,104 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4382 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-04-05 21:54:02,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:02,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-04-05 21:54:02,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-05 21:54:02,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-05 21:54:02,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2018-04-05 21:54:02,562 INFO L87 Difference]: Start difference. First operand 587 states and 603 transitions. Second operand 35 states. [2018-04-05 21:54:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:04,283 INFO L93 Difference]: Finished difference Result 599 states and 617 transitions. [2018-04-05 21:54:04,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-05 21:54:04,283 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 417 [2018-04-05 21:54:04,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:04,285 INFO L225 Difference]: With dead ends: 599 [2018-04-05 21:54:04,285 INFO L226 Difference]: Without dead ends: 598 [2018-04-05 21:54:04,286 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 868 GetRequests, 785 SyntacticMatches, 15 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1299, Invalid=3531, Unknown=0, NotChecked=0, Total=4830 [2018-04-05 21:54:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-04-05 21:54:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 590. [2018-04-05 21:54:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-05 21:54:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 600 transitions. [2018-04-05 21:54:04,310 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 600 transitions. Word has length 417 [2018-04-05 21:54:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:04,311 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 600 transitions. [2018-04-05 21:54:04,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-05 21:54:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 600 transitions. [2018-04-05 21:54:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-04-05 21:54:04,314 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:04,315 INFO L355 BasicCegarLoop]: trace histogram [44, 36, 35, 35, 35, 35, 35, 35, 35, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:04,315 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:04,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1407075858, now seen corresponding path program 16 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:04,324 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:04,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6668 backedges. 2300 proven. 210 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-04-05 21:54:04,899 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6668 backedges. 2300 proven. 210 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-04-05 21:54:05,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:05,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 50 [2018-04-05 21:54:05,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-05 21:54:05,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-05 21:54:05,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2308, Unknown=0, NotChecked=0, Total=2550 [2018-04-05 21:54:05,416 INFO L87 Difference]: Start difference. First operand 590 states and 600 transitions. Second operand 51 states. [2018-04-05 21:54:06,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:06,880 INFO L93 Difference]: Finished difference Result 620 states and 637 transitions. [2018-04-05 21:54:06,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-05 21:54:06,880 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 496 [2018-04-05 21:54:06,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:06,882 INFO L225 Difference]: With dead ends: 620 [2018-04-05 21:54:06,882 INFO L226 Difference]: Without dead ends: 619 [2018-04-05 21:54:06,883 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 925 SyntacticMatches, 19 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2363 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=865, Invalid=7145, Unknown=0, NotChecked=0, Total=8010 [2018-04-05 21:54:06,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-04-05 21:54:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 598. [2018-04-05 21:54:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-04-05 21:54:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 609 transitions. [2018-04-05 21:54:06,902 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 609 transitions. Word has length 496 [2018-04-05 21:54:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:06,903 INFO L459 AbstractCegarLoop]: Abstraction has 598 states and 609 transitions. [2018-04-05 21:54:06,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-05 21:54:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 609 transitions. [2018-04-05 21:54:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-04-05 21:54:06,906 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:06,906 INFO L355 BasicCegarLoop]: trace histogram [44, 36, 36, 35, 35, 35, 35, 35, 35, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:06,906 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:06,906 INFO L82 PathProgramCache]: Analyzing trace with hash 669678871, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:06,912 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:07,006 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:07,008 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-05 21:54:07,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 21:54:07,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 21:54:07,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 21:54:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6703 backedges. 2052 proven. 217 refuted. 0 times theorem prover too weak. 4434 trivial. 0 not checked. [2018-04-05 21:54:07,594 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6703 backedges. 2052 proven. 217 refuted. 0 times theorem prover too weak. 4434 trivial. 0 not checked. [2018-04-05 21:54:08,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:08,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-04-05 21:54:08,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-05 21:54:08,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-05 21:54:08,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2018-04-05 21:54:08,167 INFO L87 Difference]: Start difference. First operand 598 states and 609 transitions. Second operand 39 states. [2018-04-05 21:54:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:10,430 INFO L93 Difference]: Finished difference Result 694 states and 775 transitions. [2018-04-05 21:54:10,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-05 21:54:10,430 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 497 [2018-04-05 21:54:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:10,432 INFO L225 Difference]: With dead ends: 694 [2018-04-05 21:54:10,432 INFO L226 Difference]: Without dead ends: 693 [2018-04-05 21:54:10,433 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1045 GetRequests, 949 SyntacticMatches, 15 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1574, Invalid=5232, Unknown=0, NotChecked=0, Total=6806 [2018-04-05 21:54:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-04-05 21:54:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 662. [2018-04-05 21:54:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-04-05 21:54:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 687 transitions. [2018-04-05 21:54:10,459 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 687 transitions. Word has length 497 [2018-04-05 21:54:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:10,460 INFO L459 AbstractCegarLoop]: Abstraction has 662 states and 687 transitions. [2018-04-05 21:54:10,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-05 21:54:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 687 transitions. [2018-04-05 21:54:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-04-05 21:54:10,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:10,463 INFO L355 BasicCegarLoop]: trace histogram [45, 37, 36, 36, 36, 36, 36, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:10,463 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:10,464 INFO L82 PathProgramCache]: Analyzing trace with hash 575258696, now seen corresponding path program 17 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:10,473 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:10,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7002 backedges. 2568 proven. 276 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-04-05 21:54:11,017 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7002 backedges. 2568 proven. 276 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-04-05 21:54:11,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:11,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 55 [2018-04-05 21:54:11,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-05 21:54:11,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-05 21:54:11,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=2573, Unknown=0, NotChecked=0, Total=2970 [2018-04-05 21:54:11,520 INFO L87 Difference]: Start difference. First operand 662 states and 687 transitions. Second operand 55 states. [2018-04-05 21:54:12,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:12,793 INFO L93 Difference]: Finished difference Result 996 states and 1047 transitions. [2018-04-05 21:54:12,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-05 21:54:12,794 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 505 [2018-04-05 21:54:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:12,796 INFO L225 Difference]: With dead ends: 996 [2018-04-05 21:54:12,796 INFO L226 Difference]: Without dead ends: 758 [2018-04-05 21:54:12,797 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1059 GetRequests, 937 SyntacticMatches, 19 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2801 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1688, Invalid=9232, Unknown=0, NotChecked=0, Total=10920 [2018-04-05 21:54:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-04-05 21:54:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 745. [2018-04-05 21:54:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-04-05 21:54:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 770 transitions. [2018-04-05 21:54:12,818 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 770 transitions. Word has length 505 [2018-04-05 21:54:12,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:12,819 INFO L459 AbstractCegarLoop]: Abstraction has 745 states and 770 transitions. [2018-04-05 21:54:12,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-05 21:54:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 770 transitions. [2018-04-05 21:54:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2018-04-05 21:54:12,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:12,822 INFO L355 BasicCegarLoop]: trace histogram [53, 44, 43, 43, 43, 43, 43, 43, 43, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:12,822 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:12,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2068505821, now seen corresponding path program 18 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:12,829 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:12,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9849 backedges. 5188 proven. 203 refuted. 0 times theorem prover too weak. 4458 trivial. 0 not checked. [2018-04-05 21:54:13,361 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9849 backedges. 5188 proven. 203 refuted. 0 times theorem prover too weak. 4458 trivial. 0 not checked. [2018-04-05 21:54:13,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:13,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 52 [2018-04-05 21:54:13,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-05 21:54:13,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-05 21:54:13,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2278, Unknown=0, NotChecked=0, Total=2652 [2018-04-05 21:54:13,963 INFO L87 Difference]: Start difference. First operand 745 states and 770 transitions. Second operand 52 states. [2018-04-05 21:54:14,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:14,793 INFO L93 Difference]: Finished difference Result 1001 states and 1055 transitions. [2018-04-05 21:54:14,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-05 21:54:14,793 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 588 [2018-04-05 21:54:14,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:14,795 INFO L225 Difference]: With dead ends: 1001 [2018-04-05 21:54:14,795 INFO L226 Difference]: Without dead ends: 757 [2018-04-05 21:54:14,797 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1215 GetRequests, 1107 SyntacticMatches, 19 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3001 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1322, Invalid=6868, Unknown=0, NotChecked=0, Total=8190 [2018-04-05 21:54:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-04-05 21:54:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 745. [2018-04-05 21:54:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-04-05 21:54:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 768 transitions. [2018-04-05 21:54:14,820 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 768 transitions. Word has length 588 [2018-04-05 21:54:14,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:14,820 INFO L459 AbstractCegarLoop]: Abstraction has 745 states and 768 transitions. [2018-04-05 21:54:14,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-05 21:54:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 768 transitions. [2018-04-05 21:54:14,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2018-04-05 21:54:14,824 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:14,824 INFO L355 BasicCegarLoop]: trace histogram [54, 45, 44, 44, 44, 44, 44, 44, 44, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:14,824 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:14,824 INFO L82 PathProgramCache]: Analyzing trace with hash 417011801, now seen corresponding path program 19 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:14,832 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:14,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10257 backedges. 3267 proven. 276 refuted. 0 times theorem prover too weak. 6714 trivial. 0 not checked. [2018-04-05 21:54:15,481 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10257 backedges. 3267 proven. 276 refuted. 0 times theorem prover too weak. 6714 trivial. 0 not checked. [2018-04-05 21:54:16,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:16,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 56 [2018-04-05 21:54:16,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-05 21:54:16,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-05 21:54:16,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2902, Unknown=0, NotChecked=0, Total=3192 [2018-04-05 21:54:16,183 INFO L87 Difference]: Start difference. First operand 745 states and 768 transitions. Second operand 57 states. [2018-04-05 21:54:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:17,745 INFO L93 Difference]: Finished difference Result 761 states and 788 transitions. [2018-04-05 21:54:17,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-05 21:54:17,745 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 597 [2018-04-05 21:54:17,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:17,747 INFO L225 Difference]: With dead ends: 761 [2018-04-05 21:54:17,747 INFO L226 Difference]: Without dead ends: 760 [2018-04-05 21:54:17,748 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1238 GetRequests, 1118 SyntacticMatches, 21 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3022 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1051, Invalid=9049, Unknown=0, NotChecked=0, Total=10100 [2018-04-05 21:54:17,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-04-05 21:54:17,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 745. [2018-04-05 21:54:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-04-05 21:54:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 767 transitions. [2018-04-05 21:54:17,770 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 767 transitions. Word has length 597 [2018-04-05 21:54:17,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:17,770 INFO L459 AbstractCegarLoop]: Abstraction has 745 states and 767 transitions. [2018-04-05 21:54:17,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-05 21:54:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 767 transitions. [2018-04-05 21:54:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2018-04-05 21:54:17,773 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:17,773 INFO L355 BasicCegarLoop]: trace histogram [55, 46, 45, 45, 45, 45, 45, 45, 45, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:17,773 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:17,773 INFO L82 PathProgramCache]: Analyzing trace with hash 938970593, now seen corresponding path program 20 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:17,778 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:17,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10674 backedges. 3609 proven. 351 refuted. 0 times theorem prover too weak. 6714 trivial. 0 not checked. [2018-04-05 21:54:18,419 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10674 backedges. 3609 proven. 351 refuted. 0 times theorem prover too weak. 6714 trivial. 0 not checked. [2018-04-05 21:54:19,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:19,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 61 [2018-04-05 21:54:19,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-05 21:54:19,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-05 21:54:19,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=3179, Unknown=0, NotChecked=0, Total=3660 [2018-04-05 21:54:19,057 INFO L87 Difference]: Start difference. First operand 745 states and 767 transitions. Second operand 61 states. [2018-04-05 21:54:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:20,447 INFO L93 Difference]: Finished difference Result 1079 states and 1124 transitions. [2018-04-05 21:54:20,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-05 21:54:20,447 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 606 [2018-04-05 21:54:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:20,449 INFO L225 Difference]: With dead ends: 1079 [2018-04-05 21:54:20,449 INFO L226 Difference]: Without dead ends: 850 [2018-04-05 21:54:20,452 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1267 GetRequests, 1131 SyntacticMatches, 21 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3534 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2067, Invalid=11505, Unknown=0, NotChecked=0, Total=13572 [2018-04-05 21:54:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-04-05 21:54:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 837. [2018-04-05 21:54:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-04-05 21:54:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 859 transitions. [2018-04-05 21:54:20,481 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 859 transitions. Word has length 606 [2018-04-05 21:54:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:20,508 INFO L459 AbstractCegarLoop]: Abstraction has 837 states and 859 transitions. [2018-04-05 21:54:20,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-05 21:54:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 859 transitions. [2018-04-05 21:54:20,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2018-04-05 21:54:20,512 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:20,512 INFO L355 BasicCegarLoop]: trace histogram [64, 54, 53, 53, 53, 53, 53, 53, 53, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:20,512 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:20,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1792910448, now seen corresponding path program 21 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:20,528 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:20,649 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 14631 backedges. 7271 proven. 268 refuted. 0 times theorem prover too weak. 7092 trivial. 0 not checked. [2018-04-05 21:54:21,194 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14631 backedges. 7271 proven. 268 refuted. 0 times theorem prover too weak. 7092 trivial. 0 not checked. [2018-04-05 21:54:21,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:21,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 58 [2018-04-05 21:54:21,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-05 21:54:21,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-05 21:54:21,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=2850, Unknown=0, NotChecked=0, Total=3306 [2018-04-05 21:54:21,928 INFO L87 Difference]: Start difference. First operand 837 states and 859 transitions. Second operand 58 states. [2018-04-05 21:54:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:22,825 INFO L93 Difference]: Finished difference Result 1084 states and 1131 transitions. [2018-04-05 21:54:22,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-05 21:54:22,825 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 698 [2018-04-05 21:54:22,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:22,827 INFO L225 Difference]: With dead ends: 1084 [2018-04-05 21:54:22,827 INFO L226 Difference]: Without dead ends: 849 [2018-04-05 21:54:22,829 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1440 GetRequests, 1319 SyntacticMatches, 21 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3839 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1640, Invalid=8662, Unknown=0, NotChecked=0, Total=10302 [2018-04-05 21:54:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-04-05 21:54:22,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 837. [2018-04-05 21:54:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-04-05 21:54:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 857 transitions. [2018-04-05 21:54:22,853 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 857 transitions. Word has length 698 [2018-04-05 21:54:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:22,854 INFO L459 AbstractCegarLoop]: Abstraction has 837 states and 857 transitions. [2018-04-05 21:54:22,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-05 21:54:22,854 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 857 transitions. [2018-04-05 21:54:22,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2018-04-05 21:54:22,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:22,857 INFO L355 BasicCegarLoop]: trace histogram [65, 55, 54, 54, 54, 54, 54, 54, 54, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:22,857 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:22,858 INFO L82 PathProgramCache]: Analyzing trace with hash 637649896, now seen corresponding path program 22 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:22,863 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:22,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15131 backedges. 4475 proven. 351 refuted. 0 times theorem prover too weak. 10305 trivial. 0 not checked. [2018-04-05 21:54:23,647 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 15131 backedges. 4475 proven. 351 refuted. 0 times theorem prover too weak. 10305 trivial. 0 not checked. [2018-04-05 21:54:24,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:24,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 62 [2018-04-05 21:54:24,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-05 21:54:24,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-05 21:54:24,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=3564, Unknown=0, NotChecked=0, Total=3906 [2018-04-05 21:54:24,444 INFO L87 Difference]: Start difference. First operand 837 states and 857 transitions. Second operand 63 states. [2018-04-05 21:54:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:26,353 INFO L93 Difference]: Finished difference Result 853 states and 876 transitions. [2018-04-05 21:54:26,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-05 21:54:26,353 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 707 [2018-04-05 21:54:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:26,355 INFO L225 Difference]: With dead ends: 853 [2018-04-05 21:54:26,356 INFO L226 Difference]: Without dead ends: 852 [2018-04-05 21:54:26,357 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1463 GetRequests, 1330 SyntacticMatches, 23 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1254, Invalid=11178, Unknown=0, NotChecked=0, Total=12432 [2018-04-05 21:54:26,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-04-05 21:54:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 837. [2018-04-05 21:54:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-04-05 21:54:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 856 transitions. [2018-04-05 21:54:26,381 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 856 transitions. Word has length 707 [2018-04-05 21:54:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:26,382 INFO L459 AbstractCegarLoop]: Abstraction has 837 states and 856 transitions. [2018-04-05 21:54:26,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-05 21:54:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 856 transitions. [2018-04-05 21:54:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2018-04-05 21:54:26,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:26,386 INFO L355 BasicCegarLoop]: trace histogram [66, 56, 55, 55, 55, 55, 55, 55, 55, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:26,386 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:26,386 INFO L82 PathProgramCache]: Analyzing trace with hash 422015794, now seen corresponding path program 23 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:26,393 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:26,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 15640 backedges. 4900 proven. 435 refuted. 0 times theorem prover too weak. 10305 trivial. 0 not checked. [2018-04-05 21:54:27,186 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:27,964 INFO L134 CoverageAnalysis]: Checked inductivity of 15640 backedges. 4900 proven. 435 refuted. 0 times theorem prover too weak. 10305 trivial. 0 not checked. [2018-04-05 21:54:27,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:27,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 67 [2018-04-05 21:54:27,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-05 21:54:27,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-05 21:54:27,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=3849, Unknown=0, NotChecked=0, Total=4422 [2018-04-05 21:54:27,986 INFO L87 Difference]: Start difference. First operand 837 states and 856 transitions. Second operand 67 states. [2018-04-05 21:54:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:29,719 INFO L93 Difference]: Finished difference Result 1171 states and 1210 transitions. [2018-04-05 21:54:29,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-05 21:54:29,719 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 716 [2018-04-05 21:54:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:29,721 INFO L225 Difference]: With dead ends: 1171 [2018-04-05 21:54:29,721 INFO L226 Difference]: Without dead ends: 951 [2018-04-05 21:54:29,723 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1493 GetRequests, 1343 SyntacticMatches, 23 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4352 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2484, Invalid=14028, Unknown=0, NotChecked=0, Total=16512 [2018-04-05 21:54:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-04-05 21:54:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 938. [2018-04-05 21:54:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-04-05 21:54:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 957 transitions. [2018-04-05 21:54:29,764 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 957 transitions. Word has length 716 [2018-04-05 21:54:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:29,765 INFO L459 AbstractCegarLoop]: Abstraction has 938 states and 957 transitions. [2018-04-05 21:54:29,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-05 21:54:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 957 transitions. [2018-04-05 21:54:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2018-04-05 21:54:29,772 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:29,772 INFO L355 BasicCegarLoop]: trace histogram [76, 65, 64, 64, 64, 64, 64, 64, 64, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:29,772 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:29,773 INFO L82 PathProgramCache]: Analyzing trace with hash 963149049, now seen corresponding path program 24 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:29,780 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:29,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 20965 backedges. 9853 proven. 342 refuted. 0 times theorem prover too weak. 10770 trivial. 0 not checked. [2018-04-05 21:54:30,620 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 20965 backedges. 9853 proven. 342 refuted. 0 times theorem prover too weak. 10770 trivial. 0 not checked. [2018-04-05 21:54:31,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:31,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 64 [2018-04-05 21:54:31,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-05 21:54:31,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-05 21:54:31,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=546, Invalid=3486, Unknown=0, NotChecked=0, Total=4032 [2018-04-05 21:54:31,564 INFO L87 Difference]: Start difference. First operand 938 states and 957 transitions. Second operand 64 states. [2018-04-05 21:54:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:32,973 INFO L93 Difference]: Finished difference Result 1176 states and 1216 transitions. [2018-04-05 21:54:32,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-05 21:54:32,974 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 817 [2018-04-05 21:54:32,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:32,977 INFO L225 Difference]: With dead ends: 1176 [2018-04-05 21:54:32,977 INFO L226 Difference]: Without dead ends: 950 [2018-04-05 21:54:32,979 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1683 GetRequests, 1549 SyntacticMatches, 23 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4780 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1992, Invalid=10664, Unknown=0, NotChecked=0, Total=12656 [2018-04-05 21:54:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-04-05 21:54:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 938. [2018-04-05 21:54:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-04-05 21:54:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 955 transitions. [2018-04-05 21:54:33,025 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 955 transitions. Word has length 817 [2018-04-05 21:54:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:33,026 INFO L459 AbstractCegarLoop]: Abstraction has 938 states and 955 transitions. [2018-04-05 21:54:33,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-05 21:54:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 955 transitions. [2018-04-05 21:54:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2018-04-05 21:54:33,032 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:33,033 INFO L355 BasicCegarLoop]: trace histogram [77, 66, 65, 65, 65, 65, 65, 65, 65, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:33,033 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash -269505853, now seen corresponding path program 25 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:33,042 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:33,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 21566 backedges. 5951 proven. 435 refuted. 0 times theorem prover too weak. 15180 trivial. 0 not checked. [2018-04-05 21:54:34,042 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21566 backedges. 5951 proven. 435 refuted. 0 times theorem prover too weak. 15180 trivial. 0 not checked. [2018-04-05 21:54:35,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:35,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 68 [2018-04-05 21:54:35,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-05 21:54:35,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-05 21:54:35,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=4294, Unknown=0, NotChecked=0, Total=4692 [2018-04-05 21:54:35,010 INFO L87 Difference]: Start difference. First operand 938 states and 955 transitions. Second operand 69 states. [2018-04-05 21:54:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:37,292 INFO L93 Difference]: Finished difference Result 954 states and 973 transitions. [2018-04-05 21:54:37,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-05 21:54:37,309 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 826 [2018-04-05 21:54:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:37,311 INFO L225 Difference]: With dead ends: 954 [2018-04-05 21:54:37,311 INFO L226 Difference]: Without dead ends: 953 [2018-04-05 21:54:37,313 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1706 GetRequests, 1560 SyntacticMatches, 25 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4583 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1474, Invalid=13532, Unknown=0, NotChecked=0, Total=15006 [2018-04-05 21:54:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-04-05 21:54:37,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 938. [2018-04-05 21:54:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-04-05 21:54:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 954 transitions. [2018-04-05 21:54:37,340 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 954 transitions. Word has length 826 [2018-04-05 21:54:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:37,341 INFO L459 AbstractCegarLoop]: Abstraction has 938 states and 954 transitions. [2018-04-05 21:54:37,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-05 21:54:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 954 transitions. [2018-04-05 21:54:37,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2018-04-05 21:54:37,345 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:37,345 INFO L355 BasicCegarLoop]: trace histogram [78, 67, 66, 66, 66, 66, 66, 66, 66, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:37,345 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:37,346 INFO L82 PathProgramCache]: Analyzing trace with hash 542118583, now seen corresponding path program 26 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:37,351 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:37,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 22176 backedges. 6468 proven. 528 refuted. 0 times theorem prover too weak. 15180 trivial. 0 not checked. [2018-04-05 21:54:38,320 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 22176 backedges. 6468 proven. 528 refuted. 0 times theorem prover too weak. 15180 trivial. 0 not checked. [2018-04-05 21:54:39,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:39,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 73 [2018-04-05 21:54:39,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-05 21:54:39,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-05 21:54:39,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=4583, Unknown=0, NotChecked=0, Total=5256 [2018-04-05 21:54:39,301 INFO L87 Difference]: Start difference. First operand 938 states and 954 transitions. Second operand 73 states. [2018-04-05 21:54:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:41,485 INFO L93 Difference]: Finished difference Result 1272 states and 1305 transitions. [2018-04-05 21:54:41,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-05 21:54:41,486 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 835 [2018-04-05 21:54:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:41,488 INFO L225 Difference]: With dead ends: 1272 [2018-04-05 21:54:41,488 INFO L226 Difference]: Without dead ends: 1061 [2018-04-05 21:54:41,491 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1737 GetRequests, 1573 SyntacticMatches, 25 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5255 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2939, Invalid=16801, Unknown=0, NotChecked=0, Total=19740 [2018-04-05 21:54:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2018-04-05 21:54:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1048. [2018-04-05 21:54:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-04-05 21:54:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1064 transitions. [2018-04-05 21:54:41,521 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1064 transitions. Word has length 835 [2018-04-05 21:54:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:41,522 INFO L459 AbstractCegarLoop]: Abstraction has 1048 states and 1064 transitions. [2018-04-05 21:54:41,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-05 21:54:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1064 transitions. [2018-04-05 21:54:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2018-04-05 21:54:41,526 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:41,527 INFO L355 BasicCegarLoop]: trace histogram [89, 77, 76, 76, 76, 76, 76, 76, 76, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:41,527 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1628900346, now seen corresponding path program 27 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:41,532 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:41,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 29154 backedges. 12988 proven. 425 refuted. 0 times theorem prover too weak. 15741 trivial. 0 not checked. [2018-04-05 21:54:42,533 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 29154 backedges. 12988 proven. 425 refuted. 0 times theorem prover too weak. 15741 trivial. 0 not checked. [2018-04-05 21:54:43,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:43,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 70 [2018-04-05 21:54:43,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-05 21:54:43,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-05 21:54:43,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=4186, Unknown=0, NotChecked=0, Total=4830 [2018-04-05 21:54:43,627 INFO L87 Difference]: Start difference. First operand 1048 states and 1064 transitions. Second operand 70 states. [2018-04-05 21:54:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:44,719 INFO L93 Difference]: Finished difference Result 1277 states and 1310 transitions. [2018-04-05 21:54:44,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-05 21:54:44,720 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 945 [2018-04-05 21:54:44,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:44,722 INFO L225 Difference]: With dead ends: 1277 [2018-04-05 21:54:44,722 INFO L226 Difference]: Without dead ends: 1060 [2018-04-05 21:54:44,724 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1944 GetRequests, 1797 SyntacticMatches, 25 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5824 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2378, Invalid=12874, Unknown=0, NotChecked=0, Total=15252 [2018-04-05 21:54:44,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2018-04-05 21:54:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1048. [2018-04-05 21:54:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-04-05 21:54:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1062 transitions. [2018-04-05 21:54:44,754 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1062 transitions. Word has length 945 [2018-04-05 21:54:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:44,754 INFO L459 AbstractCegarLoop]: Abstraction has 1048 states and 1062 transitions. [2018-04-05 21:54:44,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-05 21:54:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1062 transitions. [2018-04-05 21:54:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2018-04-05 21:54:44,759 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:44,760 INFO L355 BasicCegarLoop]: trace histogram [90, 78, 77, 77, 77, 77, 77, 77, 77, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:44,760 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:44,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2050312594, now seen corresponding path program 28 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:44,765 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:44,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 29865 backedges. 7722 proven. 528 refuted. 0 times theorem prover too weak. 21615 trivial. 0 not checked. [2018-04-05 21:54:45,918 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 29865 backedges. 7722 proven. 528 refuted. 0 times theorem prover too weak. 21615 trivial. 0 not checked. [2018-04-05 21:54:47,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:47,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 74 [2018-04-05 21:54:47,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-05 21:54:47,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-05 21:54:47,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=5092, Unknown=0, NotChecked=0, Total=5550 [2018-04-05 21:54:47,136 INFO L87 Difference]: Start difference. First operand 1048 states and 1062 transitions. Second operand 75 states. [2018-04-05 21:54:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:49,791 INFO L93 Difference]: Finished difference Result 1064 states and 1079 transitions. [2018-04-05 21:54:49,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-05 21:54:49,791 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 954 [2018-04-05 21:54:49,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:49,794 INFO L225 Difference]: With dead ends: 1064 [2018-04-05 21:54:49,794 INFO L226 Difference]: Without dead ends: 1063 [2018-04-05 21:54:49,795 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1967 GetRequests, 1808 SyntacticMatches, 27 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5485 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1711, Invalid=16111, Unknown=0, NotChecked=0, Total=17822 [2018-04-05 21:54:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-04-05 21:54:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1048. [2018-04-05 21:54:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-04-05 21:54:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1061 transitions. [2018-04-05 21:54:49,825 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1061 transitions. Word has length 954 [2018-04-05 21:54:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:49,826 INFO L459 AbstractCegarLoop]: Abstraction has 1048 states and 1061 transitions. [2018-04-05 21:54:49,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-05 21:54:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1061 transitions. [2018-04-05 21:54:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2018-04-05 21:54:49,831 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:49,831 INFO L355 BasicCegarLoop]: trace histogram [91, 79, 78, 78, 78, 78, 78, 78, 78, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:49,831 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:49,831 INFO L82 PathProgramCache]: Analyzing trace with hash 786345160, now seen corresponding path program 29 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:49,837 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:50,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 30585 backedges. 8340 proven. 630 refuted. 0 times theorem prover too weak. 21615 trivial. 0 not checked. [2018-04-05 21:54:50,989 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 30585 backedges. 8340 proven. 630 refuted. 0 times theorem prover too weak. 21615 trivial. 0 not checked. [2018-04-05 21:54:52,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:52,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 79 [2018-04-05 21:54:52,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-05 21:54:52,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-05 21:54:52,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=781, Invalid=5381, Unknown=0, NotChecked=0, Total=6162 [2018-04-05 21:54:52,089 INFO L87 Difference]: Start difference. First operand 1048 states and 1061 transitions. Second operand 79 states. [2018-04-05 21:54:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:54,491 INFO L93 Difference]: Finished difference Result 1382 states and 1409 transitions. [2018-04-05 21:54:54,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-05 21:54:54,491 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 963 [2018-04-05 21:54:54,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:54,494 INFO L225 Difference]: With dead ends: 1382 [2018-04-05 21:54:54,494 INFO L226 Difference]: Without dead ends: 1180 [2018-04-05 21:54:54,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1999 GetRequests, 1821 SyntacticMatches, 27 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6243 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3432, Invalid=19824, Unknown=0, NotChecked=0, Total=23256 [2018-04-05 21:54:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2018-04-05 21:54:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1167. [2018-04-05 21:54:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2018-04-05 21:54:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1180 transitions. [2018-04-05 21:54:54,530 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1180 transitions. Word has length 963 [2018-04-05 21:54:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:54,530 INFO L459 AbstractCegarLoop]: Abstraction has 1167 states and 1180 transitions. [2018-04-05 21:54:54,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-05 21:54:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1180 transitions. [2018-04-05 21:54:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1083 [2018-04-05 21:54:54,537 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:54,537 INFO L355 BasicCegarLoop]: trace histogram [103, 90, 89, 89, 89, 89, 89, 89, 89, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:54,537 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1404777379, now seen corresponding path program 30 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:54,546 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:54,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 39528 backedges. 16730 proven. 517 refuted. 0 times theorem prover too weak. 22281 trivial. 0 not checked. [2018-04-05 21:54:55,751 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:54:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 39528 backedges. 16730 proven. 517 refuted. 0 times theorem prover too weak. 22281 trivial. 0 not checked. [2018-04-05 21:54:57,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:54:57,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 76 [2018-04-05 21:54:57,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-05 21:54:57,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-05 21:54:57,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=4950, Unknown=0, NotChecked=0, Total=5700 [2018-04-05 21:54:57,044 INFO L87 Difference]: Start difference. First operand 1167 states and 1180 transitions. Second operand 76 states. [2018-04-05 21:54:58,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:54:58,396 INFO L93 Difference]: Finished difference Result 1387 states and 1413 transitions. [2018-04-05 21:54:58,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-05 21:54:58,396 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 1082 [2018-04-05 21:54:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:54:58,399 INFO L225 Difference]: With dead ends: 1387 [2018-04-05 21:54:58,399 INFO L226 Difference]: Without dead ends: 1179 [2018-04-05 21:54:58,400 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2223 GetRequests, 2063 SyntacticMatches, 27 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6971 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2798, Invalid=15292, Unknown=0, NotChecked=0, Total=18090 [2018-04-05 21:54:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-04-05 21:54:58,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1167. [2018-04-05 21:54:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2018-04-05 21:54:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1178 transitions. [2018-04-05 21:54:58,433 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1178 transitions. Word has length 1082 [2018-04-05 21:54:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:54:58,434 INFO L459 AbstractCegarLoop]: Abstraction has 1167 states and 1178 transitions. [2018-04-05 21:54:58,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-05 21:54:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1178 transitions. [2018-04-05 21:54:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1092 [2018-04-05 21:54:58,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:54:58,440 INFO L355 BasicCegarLoop]: trace histogram [104, 91, 90, 90, 90, 90, 90, 90, 90, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:54:58,440 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:54:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1501247193, now seen corresponding path program 31 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:54:58,446 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:54:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:54:58,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:54:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 40358 backedges. 9815 proven. 630 refuted. 0 times theorem prover too weak. 29913 trivial. 0 not checked. [2018-04-05 21:54:59,784 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:55:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 40358 backedges. 9815 proven. 630 refuted. 0 times theorem prover too weak. 29913 trivial. 0 not checked. [2018-04-05 21:55:01,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:55:01,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 80 [2018-04-05 21:55:01,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-05 21:55:01,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-05 21:55:01,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=5958, Unknown=0, NotChecked=0, Total=6480 [2018-04-05 21:55:01,157 INFO L87 Difference]: Start difference. First operand 1167 states and 1178 transitions. Second operand 81 states. [2018-04-05 21:55:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:55:04,187 INFO L93 Difference]: Finished difference Result 1183 states and 1194 transitions. [2018-04-05 21:55:04,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-05 21:55:04,187 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 1091 [2018-04-05 21:55:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:55:04,190 INFO L225 Difference]: With dead ends: 1183 [2018-04-05 21:55:04,190 INFO L226 Difference]: Without dead ends: 1182 [2018-04-05 21:55:04,192 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2246 GetRequests, 2074 SyntacticMatches, 29 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6468 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1965, Invalid=18915, Unknown=0, NotChecked=0, Total=20880 [2018-04-05 21:55:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-04-05 21:55:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1167. [2018-04-05 21:55:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2018-04-05 21:55:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1177 transitions. [2018-04-05 21:55:04,241 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1177 transitions. Word has length 1091 [2018-04-05 21:55:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:55:04,242 INFO L459 AbstractCegarLoop]: Abstraction has 1167 states and 1177 transitions. [2018-04-05 21:55:04,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-05 21:55:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1177 transitions. [2018-04-05 21:55:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1101 [2018-04-05 21:55:04,251 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:55:04,252 INFO L355 BasicCegarLoop]: trace histogram [105, 92, 91, 91, 91, 91, 91, 91, 91, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:55:04,252 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:55:04,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1800519521, now seen corresponding path program 32 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:55:04,269 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:55:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:55:04,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:55:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 41197 backedges. 10543 proven. 741 refuted. 0 times theorem prover too weak. 29913 trivial. 0 not checked. [2018-04-05 21:55:05,631 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:55:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 41197 backedges. 10543 proven. 741 refuted. 0 times theorem prover too weak. 29913 trivial. 0 not checked. [2018-04-05 21:55:07,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:55:07,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 85 [2018-04-05 21:55:07,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-05 21:55:07,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-05 21:55:07,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=897, Invalid=6243, Unknown=0, NotChecked=0, Total=7140 [2018-04-05 21:55:07,018 INFO L87 Difference]: Start difference. First operand 1167 states and 1177 transitions. Second operand 85 states. [2018-04-05 21:55:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:55:09,417 INFO L93 Difference]: Finished difference Result 1501 states and 1522 transitions. [2018-04-05 21:55:09,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-05 21:55:09,418 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 1100 [2018-04-05 21:55:09,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:55:09,421 INFO L225 Difference]: With dead ends: 1501 [2018-04-05 21:55:09,421 INFO L226 Difference]: Without dead ends: 1308 [2018-04-05 21:55:09,423 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2279 GetRequests, 2087 SyntacticMatches, 29 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3963, Invalid=23097, Unknown=0, NotChecked=0, Total=27060 [2018-04-05 21:55:09,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2018-04-05 21:55:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1295. [2018-04-05 21:55:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2018-04-05 21:55:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1305 transitions. [2018-04-05 21:55:09,462 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1305 transitions. Word has length 1100 [2018-04-05 21:55:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:55:09,462 INFO L459 AbstractCegarLoop]: Abstraction has 1295 states and 1305 transitions. [2018-04-05 21:55:09,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-05 21:55:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1305 transitions. [2018-04-05 21:55:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2018-04-05 21:55:09,470 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:55:09,470 INFO L355 BasicCegarLoop]: trace histogram [118, 104, 103, 103, 103, 103, 103, 103, 103, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:55:09,470 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:55:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash 733022320, now seen corresponding path program 33 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:55:09,476 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:55:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:55:09,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:55:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 52444 backedges. 21133 proven. 618 refuted. 0 times theorem prover too weak. 30693 trivial. 0 not checked. [2018-04-05 21:55:10,898 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:55:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 52444 backedges. 21133 proven. 618 refuted. 0 times theorem prover too weak. 30693 trivial. 0 not checked. [2018-04-05 21:55:12,406 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:55:12,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 82 [2018-04-05 21:55:12,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-05 21:55:12,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-05 21:55:12,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=5778, Unknown=0, NotChecked=0, Total=6642 [2018-04-05 21:55:12,408 INFO L87 Difference]: Start difference. First operand 1295 states and 1305 transitions. Second operand 82 states. [2018-04-05 21:55:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:55:14,041 INFO L93 Difference]: Finished difference Result 1506 states and 1525 transitions. [2018-04-05 21:55:14,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-05 21:55:14,041 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 1228 [2018-04-05 21:55:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:55:14,044 INFO L225 Difference]: With dead ends: 1506 [2018-04-05 21:55:14,044 INFO L226 Difference]: Without dead ends: 1307 [2018-04-05 21:55:14,046 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2520 GetRequests, 2347 SyntacticMatches, 29 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8221 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3252, Invalid=17918, Unknown=0, NotChecked=0, Total=21170 [2018-04-05 21:55:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2018-04-05 21:55:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1295. [2018-04-05 21:55:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2018-04-05 21:55:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1303 transitions. [2018-04-05 21:55:14,096 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1303 transitions. Word has length 1228 [2018-04-05 21:55:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:55:14,097 INFO L459 AbstractCegarLoop]: Abstraction has 1295 states and 1303 transitions. [2018-04-05 21:55:14,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-05 21:55:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1303 transitions. [2018-04-05 21:55:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1238 [2018-04-05 21:55:14,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:55:14,107 INFO L355 BasicCegarLoop]: trace histogram [119, 105, 104, 104, 104, 104, 104, 104, 104, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:55:14,107 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:55:14,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1580734696, now seen corresponding path program 34 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:55:14,115 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:55:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:55:14,328 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:55:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 53402 backedges. 12257 proven. 741 refuted. 0 times theorem prover too weak. 40404 trivial. 0 not checked. [2018-04-05 21:55:15,736 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:55:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 53402 backedges. 12257 proven. 741 refuted. 0 times theorem prover too weak. 40404 trivial. 0 not checked. [2018-04-05 21:55:17,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:55:17,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 86 [2018-04-05 21:55:17,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-05 21:55:17,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-05 21:55:17,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=6892, Unknown=0, NotChecked=0, Total=7482 [2018-04-05 21:55:17,400 INFO L87 Difference]: Start difference. First operand 1295 states and 1303 transitions. Second operand 87 states. [2018-04-05 21:55:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:55:21,011 INFO L93 Difference]: Finished difference Result 1311 states and 1318 transitions. [2018-04-05 21:55:21,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-05 21:55:21,011 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1237 [2018-04-05 21:55:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:55:21,015 INFO L225 Difference]: With dead ends: 1311 [2018-04-05 21:55:21,015 INFO L226 Difference]: Without dead ends: 1310 [2018-04-05 21:55:21,016 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2543 GetRequests, 2358 SyntacticMatches, 31 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7532 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2236, Invalid=21944, Unknown=0, NotChecked=0, Total=24180 [2018-04-05 21:55:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2018-04-05 21:55:21,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1295. [2018-04-05 21:55:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2018-04-05 21:55:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1302 transitions. [2018-04-05 21:55:21,055 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1302 transitions. Word has length 1237 [2018-04-05 21:55:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:55:21,055 INFO L459 AbstractCegarLoop]: Abstraction has 1295 states and 1302 transitions. [2018-04-05 21:55:21,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-05 21:55:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1302 transitions. [2018-04-05 21:55:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2018-04-05 21:55:21,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:55:21,064 INFO L355 BasicCegarLoop]: trace histogram [120, 106, 105, 105, 105, 105, 105, 105, 105, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:55:21,064 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:55:21,064 INFO L82 PathProgramCache]: Analyzing trace with hash 541113906, now seen corresponding path program 35 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:55:21,069 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:55:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:55:21,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:55:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 54369 backedges. 13104 proven. 861 refuted. 0 times theorem prover too weak. 40404 trivial. 0 not checked. [2018-04-05 21:55:22,643 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:55:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 54369 backedges. 13104 proven. 861 refuted. 0 times theorem prover too weak. 40404 trivial. 0 not checked. [2018-04-05 21:55:24,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:55:24,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 91 [2018-04-05 21:55:24,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-05 21:55:24,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-05 21:55:24,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1021, Invalid=7169, Unknown=0, NotChecked=0, Total=8190 [2018-04-05 21:55:24,207 INFO L87 Difference]: Start difference. First operand 1295 states and 1302 transitions. Second operand 91 states. [2018-04-05 21:55:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:55:27,079 INFO L93 Difference]: Finished difference Result 1632 states and 1647 transitions. [2018-04-05 21:55:27,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-04-05 21:55:27,079 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1246 [2018-04-05 21:55:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:55:27,083 INFO L225 Difference]: With dead ends: 1632 [2018-04-05 21:55:27,083 INFO L226 Difference]: Without dead ends: 1448 [2018-04-05 21:55:27,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2577 GetRequests, 2371 SyntacticMatches, 31 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8474 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4532, Invalid=26620, Unknown=0, NotChecked=0, Total=31152 [2018-04-05 21:55:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2018-04-05 21:55:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1432. [2018-04-05 21:55:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2018-04-05 21:55:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1439 transitions. [2018-04-05 21:55:27,128 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1439 transitions. Word has length 1246 [2018-04-05 21:55:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:55:27,128 INFO L459 AbstractCegarLoop]: Abstraction has 1432 states and 1439 transitions. [2018-04-05 21:55:27,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-05 21:55:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1439 transitions. [2018-04-05 21:55:27,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1258 [2018-04-05 21:55:27,136 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:55:27,137 INFO L355 BasicCegarLoop]: trace histogram [119, 104, 104, 104, 104, 104, 104, 104, 104, 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] [2018-04-05 21:55:27,137 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:55:27,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1167181417, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:55:27,143 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:55:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:55:27,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:55:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 53454 backedges. 12280 proven. 728 refuted. 0 times theorem prover too weak. 40446 trivial. 0 not checked. [2018-04-05 21:55:28,706 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:55:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 53454 backedges. 12280 proven. 728 refuted. 0 times theorem prover too weak. 40446 trivial. 0 not checked. [2018-04-05 21:55:30,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:55:30,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 88 [2018-04-05 21:55:30,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-05 21:55:30,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-05 21:55:30,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=986, Invalid=6670, Unknown=0, NotChecked=0, Total=7656 [2018-04-05 21:55:30,344 INFO L87 Difference]: Start difference. First operand 1432 states and 1439 transitions. Second operand 88 states. [2018-04-05 21:55:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:55:32,096 INFO L93 Difference]: Finished difference Result 1634 states and 1646 transitions. [2018-04-05 21:55:32,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-04-05 21:55:32,096 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 1257 [2018-04-05 21:55:32,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:55:32,100 INFO L225 Difference]: With dead ends: 1634 [2018-04-05 21:55:32,100 INFO L226 Difference]: Without dead ends: 1444 [2018-04-05 21:55:32,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2583 GetRequests, 2397 SyntacticMatches, 31 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9574 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3740, Invalid=20752, Unknown=0, NotChecked=0, Total=24492 [2018-04-05 21:55:32,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2018-04-05 21:55:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1432. [2018-04-05 21:55:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2018-04-05 21:55:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1437 transitions. [2018-04-05 21:55:32,144 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1437 transitions. Word has length 1257 [2018-04-05 21:55:32,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:55:32,144 INFO L459 AbstractCegarLoop]: Abstraction has 1432 states and 1437 transitions. [2018-04-05 21:55:32,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-05 21:55:32,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1437 transitions. [2018-04-05 21:55:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1267 [2018-04-05 21:55:32,152 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:55:32,153 INFO L355 BasicCegarLoop]: trace histogram [120, 105, 105, 105, 105, 105, 105, 105, 105, 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] [2018-04-05 21:55:32,153 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:55:32,153 INFO L82 PathProgramCache]: Analyzing trace with hash -301145421, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:55:32,158 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:55:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:55:32,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:55:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 54420 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 53445 trivial. 0 not checked. [2018-04-05 21:55:33,037 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:55:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 54420 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 53445 trivial. 0 not checked. [2018-04-05 21:55:34,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:55:34,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-04-05 21:55:34,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-05 21:55:34,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-05 21:55:34,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2018-04-05 21:55:34,109 INFO L87 Difference]: Start difference. First operand 1432 states and 1437 transitions. Second operand 64 states. [2018-04-05 21:55:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:55:35,460 INFO L93 Difference]: Finished difference Result 1622 states and 1658 transitions. [2018-04-05 21:55:35,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-05 21:55:35,460 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1266 [2018-04-05 21:55:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:55:35,465 INFO L225 Difference]: With dead ends: 1622 [2018-04-05 21:55:35,466 INFO L226 Difference]: Without dead ends: 1600 [2018-04-05 21:55:35,467 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2591 GetRequests, 2469 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3257 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4867, Invalid=10385, Unknown=0, NotChecked=0, Total=15252 [2018-04-05 21:55:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2018-04-05 21:55:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1573. [2018-04-05 21:55:35,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-04-05 21:55:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1608 transitions. [2018-04-05 21:55:35,520 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1608 transitions. Word has length 1266 [2018-04-05 21:55:35,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:55:35,521 INFO L459 AbstractCegarLoop]: Abstraction has 1573 states and 1608 transitions. [2018-04-05 21:55:35,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-05 21:55:35,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1608 transitions. [2018-04-05 21:55:35,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1393 [2018-04-05 21:55:35,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:55:35,536 INFO L355 BasicCegarLoop]: trace histogram [135, 120, 119, 119, 119, 119, 119, 119, 119, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:55:35,537 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:55:35,537 INFO L82 PathProgramCache]: Analyzing trace with hash 153877187, now seen corresponding path program 36 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:55:35,543 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:55:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:55:35,771 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:55:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 69381 backedges. 15075 proven. 861 refuted. 0 times theorem prover too weak. 53445 trivial. 0 not checked. [2018-04-05 21:55:37,403 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:55:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 69381 backedges. 15075 proven. 861 refuted. 0 times theorem prover too weak. 53445 trivial. 0 not checked. [2018-04-05 21:55:39,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:55:39,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 92 [2018-04-05 21:55:39,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-05 21:55:39,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-05 21:55:39,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=7894, Unknown=0, NotChecked=0, Total=8556 [2018-04-05 21:55:39,335 INFO L87 Difference]: Start difference. First operand 1573 states and 1608 transitions. Second operand 93 states. [2018-04-05 21:55:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:55:43,083 INFO L93 Difference]: Finished difference Result 1593 states and 1641 transitions. [2018-04-05 21:55:43,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-05 21:55:43,083 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1392 [2018-04-05 21:55:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:55:43,087 INFO L225 Difference]: With dead ends: 1593 [2018-04-05 21:55:43,087 INFO L226 Difference]: Without dead ends: 1592 [2018-04-05 21:55:43,089 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2858 GetRequests, 2660 SyntacticMatches, 33 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8677 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2524, Invalid=25198, Unknown=0, NotChecked=0, Total=27722 [2018-04-05 21:55:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2018-04-05 21:55:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1573. [2018-04-05 21:55:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-04-05 21:55:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1607 transitions. [2018-04-05 21:55:43,136 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1607 transitions. Word has length 1392 [2018-04-05 21:55:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:55:43,137 INFO L459 AbstractCegarLoop]: Abstraction has 1573 states and 1607 transitions. [2018-04-05 21:55:43,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-05 21:55:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1607 transitions. [2018-04-05 21:55:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1397 [2018-04-05 21:55:43,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:55:43,147 INFO L355 BasicCegarLoop]: trace histogram [135, 119, 119, 119, 119, 119, 119, 119, 119, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:55:43,147 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:55:43,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1207275285, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:55:43,152 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:55:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:55:43,382 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:55:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 69337 backedges. 15000 proven. 847 refuted. 0 times theorem prover too weak. 53490 trivial. 0 not checked. [2018-04-05 21:55:44,960 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:55:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 69337 backedges. 15000 proven. 847 refuted. 0 times theorem prover too weak. 53490 trivial. 0 not checked. [2018-04-05 21:55:46,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:55:46,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 94 [2018-04-05 21:55:46,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-04-05 21:55:46,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-04-05 21:55:46,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1116, Invalid=7626, Unknown=0, NotChecked=0, Total=8742 [2018-04-05 21:55:46,864 INFO L87 Difference]: Start difference. First operand 1573 states and 1607 transitions. Second operand 94 states. [2018-04-05 21:55:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:55:48,494 INFO L93 Difference]: Finished difference Result 1908 states and 1989 transitions. [2018-04-05 21:55:48,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-04-05 21:55:48,494 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 1396 [2018-04-05 21:55:48,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:55:48,497 INFO L225 Difference]: With dead ends: 1908 [2018-04-05 21:55:48,497 INFO L226 Difference]: Without dead ends: 1589 [2018-04-05 21:55:48,501 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2866 GetRequests, 2667 SyntacticMatches, 33 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11030 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4262, Invalid=23794, Unknown=0, NotChecked=0, Total=28056 [2018-04-05 21:55:48,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2018-04-05 21:55:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1573. [2018-04-05 21:55:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-04-05 21:55:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1606 transitions. [2018-04-05 21:55:48,546 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1606 transitions. Word has length 1396 [2018-04-05 21:55:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:55:48,546 INFO L459 AbstractCegarLoop]: Abstraction has 1573 states and 1606 transitions. [2018-04-05 21:55:48,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-04-05 21:55:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1606 transitions. [2018-04-05 21:55:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1402 [2018-04-05 21:55:48,556 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:55:48,556 INFO L355 BasicCegarLoop]: trace histogram [136, 121, 120, 120, 120, 120, 120, 120, 120, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:55:48,556 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:55:48,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1645362505, now seen corresponding path program 37 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:55:48,562 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:55:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:55:48,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:55:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 70485 backedges. 16050 proven. 990 refuted. 0 times theorem prover too weak. 53445 trivial. 0 not checked. [2018-04-05 21:55:50,376 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:55:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 70485 backedges. 16050 proven. 990 refuted. 0 times theorem prover too weak. 53445 trivial. 0 not checked. [2018-04-05 21:55:52,248 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:55:52,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 97 [2018-04-05 21:55:52,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-05 21:55:52,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-05 21:55:52,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=8159, Unknown=0, NotChecked=0, Total=9312 [2018-04-05 21:55:52,250 INFO L87 Difference]: Start difference. First operand 1573 states and 1606 transitions. Second operand 97 states. [2018-04-05 21:55:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:55:55,620 INFO L93 Difference]: Finished difference Result 2046 states and 2111 transitions. [2018-04-05 21:55:55,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-04-05 21:55:55,645 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1401 [2018-04-05 21:55:55,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:55:55,648 INFO L225 Difference]: With dead ends: 2046 [2018-04-05 21:55:55,648 INFO L226 Difference]: Without dead ends: 1730 [2018-04-05 21:55:55,651 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2893 GetRequests, 2673 SyntacticMatches, 33 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9717 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5139, Invalid=30393, Unknown=0, NotChecked=0, Total=35532 [2018-04-05 21:55:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2018-04-05 21:55:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1719. [2018-04-05 21:55:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2018-04-05 21:55:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 1751 transitions. [2018-04-05 21:55:55,703 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 1751 transitions. Word has length 1401 [2018-04-05 21:55:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:55:55,703 INFO L459 AbstractCegarLoop]: Abstraction has 1719 states and 1751 transitions. [2018-04-05 21:55:55,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-05 21:55:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 1751 transitions. [2018-04-05 21:55:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1406 [2018-04-05 21:55:55,713 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:55:55,713 INFO L355 BasicCegarLoop]: trace histogram [136, 120, 120, 120, 120, 120, 120, 120, 120, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:55:55,713 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:55:55,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1779811063, now seen corresponding path program 7 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:55:55,720 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:55:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:55:55,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:55:55,970 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-05 21:55:55,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 21:55:55,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 21:55:55,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 21:55:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 70440 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 69420 trivial. 0 not checked. [2018-04-05 21:55:59,533 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:56:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 70440 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 69420 trivial. 0 not checked. [2018-04-05 21:56:01,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:56:01,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 66 [2018-04-05 21:56:01,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-05 21:56:01,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-05 21:56:01,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=3715, Unknown=0, NotChecked=0, Total=4422 [2018-04-05 21:56:01,367 INFO L87 Difference]: Start difference. First operand 1719 states and 1751 transitions. Second operand 67 states. [2018-04-05 21:56:08,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:56:08,442 INFO L93 Difference]: Finished difference Result 1731 states and 1765 transitions. [2018-04-05 21:56:08,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-05 21:56:08,443 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 1405 [2018-04-05 21:56:08,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:56:08,445 INFO L225 Difference]: With dead ends: 1731 [2018-04-05 21:56:08,445 INFO L226 Difference]: Without dead ends: 1730 [2018-04-05 21:56:08,447 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2884 GetRequests, 2713 SyntacticMatches, 31 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5258 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5043, Invalid=14979, Unknown=0, NotChecked=0, Total=20022 [2018-04-05 21:56:08,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2018-04-05 21:56:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1722. [2018-04-05 21:56:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2018-04-05 21:56:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 1740 transitions. [2018-04-05 21:56:08,504 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 1740 transitions. Word has length 1405 [2018-04-05 21:56:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:56:08,504 INFO L459 AbstractCegarLoop]: Abstraction has 1722 states and 1740 transitions. [2018-04-05 21:56:08,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-05 21:56:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 1740 transitions. [2018-04-05 21:56:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1557 [2018-04-05 21:56:08,516 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:56:08,516 INFO L355 BasicCegarLoop]: trace histogram [152, 136, 135, 135, 135, 135, 135, 135, 135, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:56:08,516 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:56:08,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1823892242, now seen corresponding path program 38 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:56:08,524 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:56:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:56:08,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:56:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 88706 backedges. 18296 proven. 990 refuted. 0 times theorem prover too weak. 69420 trivial. 0 not checked. [2018-04-05 21:56:10,769 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:56:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 88706 backedges. 18296 proven. 990 refuted. 0 times theorem prover too weak. 69420 trivial. 0 not checked. [2018-04-05 21:56:13,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:56:13,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 98 [2018-04-05 21:56:13,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-05 21:56:13,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-05 21:56:13,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=738, Invalid=8964, Unknown=0, NotChecked=0, Total=9702 [2018-04-05 21:56:13,010 INFO L87 Difference]: Start difference. First operand 1722 states and 1740 transitions. Second operand 99 states. [2018-04-05 21:56:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:56:17,265 INFO L93 Difference]: Finished difference Result 1752 states and 1785 transitions. [2018-04-05 21:56:17,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-05 21:56:17,265 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 1556 [2018-04-05 21:56:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:56:17,269 INFO L225 Difference]: With dead ends: 1752 [2018-04-05 21:56:17,269 INFO L226 Difference]: Without dead ends: 1751 [2018-04-05 21:56:17,271 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3192 GetRequests, 2981 SyntacticMatches, 35 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9903 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2829, Invalid=28677, Unknown=0, NotChecked=0, Total=31506 [2018-04-05 21:56:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2018-04-05 21:56:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1730. [2018-04-05 21:56:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1730 states. [2018-04-05 21:56:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 1749 transitions. [2018-04-05 21:56:17,328 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 1749 transitions. Word has length 1556 [2018-04-05 21:56:17,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:56:17,329 INFO L459 AbstractCegarLoop]: Abstraction has 1730 states and 1749 transitions. [2018-04-05 21:56:17,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-05 21:56:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 1749 transitions. [2018-04-05 21:56:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1558 [2018-04-05 21:56:17,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:56:17,341 INFO L355 BasicCegarLoop]: trace histogram [152, 136, 136, 135, 135, 135, 135, 135, 135, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:56:17,341 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:56:17,341 INFO L82 PathProgramCache]: Analyzing trace with hash 706084887, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:56:17,348 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:56:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:56:17,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:56:17,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 21:56:17,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 21:56:17,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 21:56:17,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 21:56:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 88841 backedges. 17288 proven. 1005 refuted. 0 times theorem prover too weak. 70548 trivial. 0 not checked. [2018-04-05 21:56:21,399 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:56:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 88841 backedges. 17288 proven. 1005 refuted. 0 times theorem prover too weak. 70548 trivial. 0 not checked. [2018-04-05 21:56:23,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:56:23,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 70 [2018-04-05 21:56:23,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-05 21:56:23,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-05 21:56:23,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=4251, Unknown=0, NotChecked=0, Total=4970 [2018-04-05 21:56:23,903 INFO L87 Difference]: Start difference. First operand 1730 states and 1749 transitions. Second operand 71 states. [2018-04-05 21:56:27,243 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 126 DAG size of output 29 [2018-04-05 21:56:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:56:33,099 INFO L93 Difference]: Finished difference Result 1930 states and 2219 transitions. [2018-04-05 21:56:33,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-05 21:56:33,100 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 1557 [2018-04-05 21:56:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:56:33,104 INFO L225 Difference]: With dead ends: 1930 [2018-04-05 21:56:33,104 INFO L226 Difference]: Without dead ends: 1929 [2018-04-05 21:56:33,106 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3221 GetRequests, 3029 SyntacticMatches, 31 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5950 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=5718, Invalid=20688, Unknown=0, NotChecked=0, Total=26406 [2018-04-05 21:56:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2018-04-05 21:56:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1866. [2018-04-05 21:56:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1866 states. [2018-04-05 21:56:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 1915 transitions. [2018-04-05 21:56:33,220 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 1915 transitions. Word has length 1557 [2018-04-05 21:56:33,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:56:33,221 INFO L459 AbstractCegarLoop]: Abstraction has 1866 states and 1915 transitions. [2018-04-05 21:56:33,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-05 21:56:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 1915 transitions. [2018-04-05 21:56:33,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1566 [2018-04-05 21:56:33,238 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:56:33,239 INFO L355 BasicCegarLoop]: trace histogram [153, 137, 136, 136, 136, 136, 136, 136, 136, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:56:33,239 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:56:33,239 INFO L82 PathProgramCache]: Analyzing trace with hash -834518200, now seen corresponding path program 39 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:56:33,245 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:56:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:56:33,544 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:56:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 89956 backedges. 19408 proven. 1128 refuted. 0 times theorem prover too weak. 69420 trivial. 0 not checked. [2018-04-05 21:56:35,416 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:56:37,464 INFO L134 CoverageAnalysis]: Checked inductivity of 89956 backedges. 19408 proven. 1128 refuted. 0 times theorem prover too weak. 69420 trivial. 0 not checked. [2018-04-05 21:56:37,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:56:37,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 103 [2018-04-05 21:56:37,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-04-05 21:56:37,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-04-05 21:56:37,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1293, Invalid=9213, Unknown=0, NotChecked=0, Total=10506 [2018-04-05 21:56:37,488 INFO L87 Difference]: Start difference. First operand 1866 states and 1915 transitions. Second operand 103 states. [2018-04-05 21:56:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:56:41,259 INFO L93 Difference]: Finished difference Result 2488 states and 2587 transitions. [2018-04-05 21:56:41,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-04-05 21:56:41,259 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 1565 [2018-04-05 21:56:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:56:41,262 INFO L225 Difference]: With dead ends: 2488 [2018-04-05 21:56:41,262 INFO L226 Difference]: Without dead ends: 2034 [2018-04-05 21:56:41,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3227 GetRequests, 2993 SyntacticMatches, 35 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11045 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5784, Invalid=34416, Unknown=0, NotChecked=0, Total=40200 [2018-04-05 21:56:41,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2018-04-05 21:56:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2021. [2018-04-05 21:56:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2018-04-05 21:56:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2070 transitions. [2018-04-05 21:56:41,380 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2070 transitions. Word has length 1565 [2018-04-05 21:56:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:56:41,381 INFO L459 AbstractCegarLoop]: Abstraction has 2021 states and 2070 transitions. [2018-04-05 21:56:41,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-04-05 21:56:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2070 transitions. [2018-04-05 21:56:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1721 [2018-04-05 21:56:41,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:56:41,403 INFO L355 BasicCegarLoop]: trace histogram [169, 152, 151, 151, 151, 151, 151, 151, 151, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:56:41,403 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:56:41,404 INFO L82 PathProgramCache]: Analyzing trace with hash 861561379, now seen corresponding path program 40 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:56:41,416 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:56:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:56:41,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:56:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 110419 backedges. 38848 proven. 975 refuted. 0 times theorem prover too weak. 70596 trivial. 0 not checked. [2018-04-05 21:56:43,792 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 21:56:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 110419 backedges. 38848 proven. 975 refuted. 0 times theorem prover too weak. 70596 trivial. 0 not checked. [2018-04-05 21:56:46,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 21:56:46,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 100 [2018-04-05 21:56:46,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-05 21:56:46,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-05 21:56:46,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1254, Invalid=8646, Unknown=0, NotChecked=0, Total=9900 [2018-04-05 21:56:46,105 INFO L87 Difference]: Start difference. First operand 2021 states and 2070 transitions. Second operand 100 states. [2018-04-05 21:56:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 21:56:48,047 INFO L93 Difference]: Finished difference Result 2493 states and 2603 transitions. [2018-04-05 21:56:48,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-04-05 21:56:48,047 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 1720 [2018-04-05 21:56:48,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 21:56:48,051 INFO L225 Difference]: With dead ends: 2493 [2018-04-05 21:56:48,051 INFO L226 Difference]: Without dead ends: 2033 [2018-04-05 21:56:48,058 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3519 GetRequests, 3307 SyntacticMatches, 35 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12589 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4818, Invalid=27044, Unknown=0, NotChecked=0, Total=31862 [2018-04-05 21:56:48,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2018-04-05 21:56:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2021. [2018-04-05 21:56:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2018-04-05 21:56:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2068 transitions. [2018-04-05 21:56:48,135 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2068 transitions. Word has length 1720 [2018-04-05 21:56:48,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 21:56:48,136 INFO L459 AbstractCegarLoop]: Abstraction has 2021 states and 2068 transitions. [2018-04-05 21:56:48,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-04-05 21:56:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2068 transitions. [2018-04-05 21:56:48,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1730 [2018-04-05 21:56:48,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 21:56:48,150 INFO L355 BasicCegarLoop]: trace histogram [170, 153, 152, 152, 152, 152, 152, 152, 152, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 21:56:48,151 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-05 21:56:48,151 INFO L82 PathProgramCache]: Analyzing trace with hash 257130329, now seen corresponding path program 41 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 21:56:48,158 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 21:56:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 21:56:48,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 21:56:50,765 INFO L134 CoverageAnalysis]: Checked inductivity of 111815 backedges. 21947 proven. 1128 refuted. 0 times theorem prover too weak. 88740 trivial. 0 not checked. [2018-04-05 21:56:50,766 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-04-05 21:56:52,280 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-05 21:56:52,281 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-05 21:56:52,283 WARN L197 ceAbstractionStarter]: Timeout [2018-04-05 21:56:52,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 09:56:52 BasicIcfg [2018-04-05 21:56:52,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-05 21:56:52,284 INFO L168 Benchmark]: Toolchain (without parser) took 219344.71 ms. Allocated memory was 304.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 247.1 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 160.2 MB. Max. memory is 5.3 GB. [2018-04-05 21:56:52,285 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 265.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-05 21:56:52,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.34 ms. Allocated memory is still 304.1 MB. Free memory was 247.1 MB in the beginning and 237.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-04-05 21:56:52,285 INFO L168 Benchmark]: Boogie Preprocessor took 32.19 ms. Allocated memory is still 304.1 MB. Free memory was 237.1 MB in the beginning and 235.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-05 21:56:52,285 INFO L168 Benchmark]: RCFGBuilder took 326.08 ms. Allocated memory was 304.1 MB in the beginning and 459.8 MB in the end (delta: 155.7 MB). Free memory was 235.1 MB in the beginning and 424.3 MB in the end (delta: -189.2 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-05 21:56:52,286 INFO L168 Benchmark]: IcfgTransformer took 18742.93 ms. Allocated memory was 459.8 MB in the beginning and 869.3 MB in the end (delta: 409.5 MB). Free memory was 424.3 MB in the beginning and 803.0 MB in the end (delta: -378.7 MB). Peak memory consumption was 533.7 MB. Max. memory is 5.3 GB. [2018-04-05 21:56:52,286 INFO L168 Benchmark]: TraceAbstraction took 200037.49 ms. Allocated memory was 869.3 MB in the beginning and 2.3 GB in the end (delta: 1.4 GB). Free memory was 803.0 MB in the beginning and 2.1 GB in the end (delta: -1.3 GB). Peak memory consumption was 151.0 MB. Max. memory is 5.3 GB. [2018-04-05 21:56:52,288 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.18 ms. Allocated memory is still 304.1 MB. Free memory is still 265.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.34 ms. Allocated memory is still 304.1 MB. Free memory was 247.1 MB in the beginning and 237.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.19 ms. Allocated memory is still 304.1 MB. Free memory was 237.1 MB in the beginning and 235.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 326.08 ms. Allocated memory was 304.1 MB in the beginning and 459.8 MB in the end (delta: 155.7 MB). Free memory was 235.1 MB in the beginning and 424.3 MB in the end (delta: -189.2 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 18742.93 ms. Allocated memory was 459.8 MB in the beginning and 869.3 MB in the end (delta: 409.5 MB). Free memory was 424.3 MB in the beginning and 803.0 MB in the end (delta: -378.7 MB). Peak memory consumption was 533.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 200037.49 ms. Allocated memory was 869.3 MB in the beginning and 2.3 GB in the end (delta: 1.4 GB). Free memory was 803.0 MB in the beginning and 2.1 GB in the end (delta: -1.3 GB). Peak memory consumption was 151.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 : 3 LocStat_NO_SUPPORTING_EQUALITIES : 540 LocStat_NO_SUPPORTING_DISEQUALITIES : 207 LocStat_NO_DISJUNCTIONS : -122 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 77 TransStat_MAX_WEQGRAPH_SIZE : 4 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 71 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 78 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2252.07 RENAME_VARIABLES(MILLISECONDS) : 353.83 UNFREEZE(MILLISECONDS) : 0.00 CONJOIN(MILLISECONDS) : 2276.74 PROJECTAWAY(MILLISECONDS) : 5050.11 ADD_WEAK_EQUALITY(MILLISECONDS) : 8.16 DISJOIN(MILLISECONDS) : 161.69 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 382.23 ADD_EQUALITY(MILLISECONDS) : 9.80 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.00 ADD_DISEQUALITY(MILLISECONDS) : 0.25 #CONJOIN_DISJUNCTIVE : 753 #RENAME_VARIABLES : 1674 #UNFREEZE : 0 #CONJOIN : 1017 #PROJECTAWAY : 979 #ADD_WEAK_EQUALITY : 10 #DISJOIN : 241 #RENAME_VARIABLES_DISJUNCTIVE : 1654 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: WeqCcManagerStatistics FREEZE(MILLISECONDS) : 12534.24 ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 2264.66 FILTERREDUNDANT(MILLISECONDS) : 0.00 REPORTWEQ(MILLISECONDS) : 8.00 JOIN(MILLISECONDS) : 152.35 RENAMEVARS(MILLISECONDS) : 337.97 FLATTENLABELS(MILLISECONDS) : 0.00 COPY(MILLISECONDS) : 0.00 ISSTRONGERTHAN(MILLISECONDS) : 9747.92 ISLABELSTRONGERTHAN(MILLISECONDS) : 1125.02 ISWEQGRAPHSTRONGERTHAN(MILLISECONDS) : 148.25 UNFREEZE(MILLISECONDS) : 125.17 REPORTCONTAINS(MILLISECONDS) : 0.50 PROJECTAWAY(MILLISECONDS) : 4873.90 MEETEDGELABELS(MILLISECONDS) : 173.40 REPORTEQUALITY(MILLISECONDS) : 279.48 ADDALLNODES(MILLISECONDS) : 322.08 REPORTDISEQUALITY(MILLISECONDS) : 4.93 WEQGRAPHJOIN(MILLISECONDS) : 63.05 #FREEZE : 10583 #ADDNODE : 0 #MEET : 675 #FILTERREDUNDANT : 0 #REPORTWEQ : 10 #JOIN : 241 #RENAMEVARS : 1674 #FLATTENLABELS : 0 #COPY : 0 #ISSTRONGERTHAN : 3621 #ISLABELSTRONGERTHAN : 104424 #ISWEQGRAPHSTRONGERTHAN : 1195 #UNFREEZE : 4781 #REPORTCONTAINS : 23 #PROJECTAWAY : 2432 #MEETEDGELABELS : 2428 #REPORTEQUALITY : 6425 #ADDALLNODES : 675 #REPORTDISEQUALITY : 1606 #WEQGRAPHJOIN : 241 - StatisticsResult: CcManagerStatistics ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 4607.70 REPORT_EQUALITY(MILLISECONDS) : 1471.43 FILTERREDUNDANT(MILLISECONDS) : 4445.71 ADD_ALL_ELEMENTS(MILLISECONDS) : 744.57 JOIN(MILLISECONDS) : 62.12 ALIGN_ELEMENTS(MILLISECONDS) : 724.73 COPY(MILLISECONDS) : 0.00 REPORT_DISEQUALITY(MILLISECONDS) : 343.87 UNFREEZE(MILLISECONDS) : 0.00 OVERALL(MILLISECONDS) : 7731.03 REPORTCONTAINS(MILLISECONDS) : 28.96 IS_STRONGER_THAN_NO_CACHING(MILLISECONDS) : 1584.15 REMOVE(MILLISECONDS) : 0.00 IS_STRONGER_THAN_W_CACHING(MILLISECONDS) : 0.00 PROJECT_TO_ELEMENTS(MILLISECONDS) : 1295.46 #ADDNODE : 0 #MEET : 22031 #REPORT_EQUALITY : 193820 #FILTERREDUNDANT : 233908 #ADD_ALL_ELEMENTS : 45843 #JOIN : 241 #ALIGN_ELEMENTS : 10963 #COPY : 0 #REPORT_DISEQUALITY : 68534 #UNFREEZE : 0 #OVERALL : 844897 #REPORTCONTAINS : 2047 #IS_STRONGER_THAN_NO_CACHING : 245545 #REMOVE : 0 #IS_STRONGER_THAN_W_CACHING : 0 #PROJECT_TO_ELEMENTS : 21965 * 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] : 3 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 1730 with TraceHistMax 170, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 1730 with TraceHistMax 170, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 1730 with TraceHistMax 170, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 20). Cancelled while BasicCegarLoop was analyzing trace of length 1730 with TraceHistMax 170, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 1730 with TraceHistMax 170, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 1730 with TraceHistMax 170, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 1730 with TraceHistMax 170, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 1730 with TraceHistMax 170, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 8 error locations. TIMEOUT Result, 199.9s OverallTime, 68 OverallIterations, 170 TraceHistogramMax, 94.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6097 SDtfs, 19939 SDslu, 103606 SDs, 0 SdLazy, 101331 SolverSat, 4672 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79066 GetRequests, 72426 SyntacticMatches, 1079 SemanticMatches, 5561 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212361 ImplicationChecksByTransitivity, 102.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2021occurred in iteration=66, 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: 1.8s AutomataMinimizationTime, 67 MinimizatonAttempts, 975 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.4s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 90.4s InterpolantComputationTime, 38241 NumberOfCodeBlocks, 38241 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 76348 ConstructedInterpolants, 3495 QuantifiedInterpolants, 177106344 SizeOfPredicates, 1865 NumberOfNonLiveVariables, 74081 ConjunctsInSsa, 2448 ConjunctsInUnsatCore, 134 InterpolantComputations, 18 PerfectInterpolantSequences, 2625970/2667924 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/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-04-05_21-56-52-298.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-04-05_21-56-52-298.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-04-05_21-56-52-298.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-1-2018-04-05_21-56-52-298.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-2-2018-04-05_21-56-52-298.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-04-05_21-56-52-298.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-05_21-56-52-298.csv Completed graceful shutdown