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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 23:37:41,291 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 23:37:41,293 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 23:37:41,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 23:37:41,306 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 23:37:41,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 23:37:41,308 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 23:37:41,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 23:37:41,312 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 23:37:41,313 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 23:37:41,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 23:37:41,314 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 23:37:41,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 23:37:41,316 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 23:37:41,317 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 23:37:41,320 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 23:37:41,322 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 23:37:41,324 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 23:37:41,325 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 23:37:41,326 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 23:37:41,328 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 23:37:41,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 23:37:41,329 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 23:37:41,330 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 23:37:41,331 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 23:37:41,332 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 23:37:41,332 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 23:37:41,333 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 23:37:41,333 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 23:37:41,333 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 23:37:41,334 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 23:37:41,334 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 23:37:41,344 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 23:37:41,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 23:37:41,345 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 23:37:41,345 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 23:37:41,345 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 23:37:41,345 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 23:37:41,346 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 23:37:41,346 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 23:37:41,346 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 23:37:41,347 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 23:37:41,347 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 23:37:41,347 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 23:37:41,347 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 23:37:41,347 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 23:37:41,347 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 23:37:41,348 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 23:37:41,348 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 23:37:41,348 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 23:37:41,348 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 23:37:41,348 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 23:37:41,349 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 23:37:41,349 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 23:37:41,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 23:37:41,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 23:37:41,349 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 23:37:41,349 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 23:37:41,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 23:37:41,350 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 23:37:41,350 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 23:37:41,350 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 23:37:41,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 23:37:41,351 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 23:37:41,351 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 23:37:41,352 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 23:37:41,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 23:37:41,398 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 23:37:41,401 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 23:37:41,403 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 23:37:41,403 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 23:37:41,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-01-28 23:37:41,573 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 23:37:41,579 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-28 23:37:41,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 23:37:41,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 23:37:41,585 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 23:37:41,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:37:41" (1/1) ... [2018-01-28 23:37:41,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3909789b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:37:41, skipping insertion in model container [2018-01-28 23:37:41,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:37:41" (1/1) ... [2018-01-28 23:37:41,603 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:37:41,640 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:37:41,759 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:37:41,779 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:37:41,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:37:41 WrapperNode [2018-01-28 23:37:41,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 23:37:41,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 23:37:41,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 23:37:41,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 23:37:41,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:37:41" (1/1) ... [2018-01-28 23:37:41,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:37:41" (1/1) ... [2018-01-28 23:37:41,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:37:41" (1/1) ... [2018-01-28 23:37:41,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:37:41" (1/1) ... [2018-01-28 23:37:41,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:37:41" (1/1) ... [2018-01-28 23:37:41,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:37:41" (1/1) ... [2018-01-28 23:37:41,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:37:41" (1/1) ... [2018-01-28 23:37:41,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 23:37:41,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 23:37:41,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 23:37:41,826 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 23:37:41,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:37:41" (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-01-28 23:37:41,872 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 23:37:41,872 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 23:37:41,872 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-01-28 23:37:41,872 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 23:37:41,873 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 23:37:41,873 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 23:37:41,873 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 23:37:41,873 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 23:37:41,873 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 23:37:41,873 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 23:37:41,873 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-01-28 23:37:41,873 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 23:37:41,873 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 23:37:41,874 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 23:37:42,128 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 23:37:42,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:37:42 BoogieIcfgContainer [2018-01-28 23:37:42,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 23:37:42,146 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-28 23:37:42,146 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-28 23:37:42,147 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-28 23:37:42,150 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:37:42" (1/1) ... [2018-01-28 23:37:42,156 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-28 23:37:42,156 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-28 23:37:42,157 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-28 23:37:42,229 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-28 23:37:42,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-28 23:38:25,556 INFO L311 AbstractInterpreter]: Visited 102 different actions 1328 times. Merged at 71 different actions 831 times. Widened at 1 different actions 4 times. Found 102 fixpoints after 13 different actions. Largest state had 46 variables. [2018-01-28 23:38:25,559 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-28 23:38:25,573 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-28 23:38:25,573 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-28 23:38:25,573 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-28 23:38:25,574 INFO L241 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_4| v_main_~nondetString1~5.base_2), at (SUMMARY for call write~int(0, ~nondetString1~5.base, ~nondetString1~5.offset + (~length1~5 - 1) * 1, 1); srcloc: L566)) ((select (select |v_#memory_int_7| v_substring_~ps~2.base_2) v_substring_~ps~2.offset_2), at (SUMMARY for call #t~mem0 := read~int(~ps~2.base, ~ps~2.offset, 1); srcloc: L543)) ((select |v_#memory_int_6| v_main_~nondetString2~5.base_2), at (SUMMARY for call write~int(0, ~nondetString2~5.base, ~nondetString2~5.offset + (~length2~5 - 1) * 1, 1); srcloc: L566')) ((select (select |v_#memory_int_11| v_substring_~pt~3.base_10) v_substring_~pt~3.offset_8), at (SUMMARY for call #t~mem7 := read~int(~pt~3.base, ~pt~3.offset, 1); srcloc: L546'''''''''''''''''')) ((select (select |v_#memory_int_9| v_substring_~pt~3.base_5) v_substring_~pt~3.offset_4), at (SUMMARY for call #t~mem2 := read~int(~pt~3.base, ~pt~3.offset, 1); srcloc: L546''')) ((select (select |v_#memory_int_10| v_substring_~ps2~3.base_2) v_substring_~ps2~3.offset_2), at (SUMMARY for call #t~mem3 := read~int(~ps2~3.base, ~ps2~3.offset, 1); srcloc: L546'''')) ((select (select |v_#memory_int_8| v_substring_~pt~3.base_2) v_substring_~pt~3.offset_2), at (SUMMARY for call #t~mem1 := read~int(~pt~3.base, ~pt~3.offset, 1); srcloc: L546)) [2018-01-28 23:38:25,596 INFO L544 PartitionManager]: partitioning result: [2018-01-28 23:38:25,597 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-28 23:38:25,597 INFO L558 PartitionManager]: at dimension 0 [2018-01-28 23:38:25,597 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:38:25,597 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:38:25,597 INFO L558 PartitionManager]: at dimension 1 [2018-01-28 23:38:25,597 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:38:25,597 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:38:25,598 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-28 23:38:25,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:38:25 BasicIcfg [2018-01-28 23:38:25,615 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-28 23:38:25,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 23:38:25,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 23:38:25,676 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 23:38:25,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:37:41" (1/4) ... [2018-01-28 23:38:25,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274f13a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:38:25, skipping insertion in model container [2018-01-28 23:38:25,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:37:41" (2/4) ... [2018-01-28 23:38:25,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274f13a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:38:25, skipping insertion in model container [2018-01-28 23:38:25,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:37:42" (3/4) ... [2018-01-28 23:38:25,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274f13a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:38:25, skipping insertion in model container [2018-01-28 23:38:25,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:38:25" (4/4) ... [2018-01-28 23:38:25,679 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-28 23:38:25,685 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 23:38:25,692 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-28 23:38:25,721 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 23:38:25,722 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 23:38:25,722 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 23:38:25,722 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 23:38:25,722 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 23:38:25,722 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 23:38:25,722 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 23:38:25,722 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 23:38:25,723 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 23:38:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-28 23:38:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 23:38:25,739 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:25,740 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:25,740 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:25,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2030631026, now seen corresponding path program 1 times [2018-01-28 23:38:25,744 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:25,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:25,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:25,783 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:25,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:25,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:25,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:25,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:38:25,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:38:25,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:38:25,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:38:25,973 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 4 states. [2018-01-28 23:38:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:26,089 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2018-01-28 23:38:26,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:38:26,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-28 23:38:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:26,103 INFO L225 Difference]: With dead ends: 154 [2018-01-28 23:38:26,103 INFO L226 Difference]: Without dead ends: 88 [2018-01-28 23:38:26,108 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:38:26,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-28 23:38:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-28 23:38:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-28 23:38:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-01-28 23:38:26,148 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 15 [2018-01-28 23:38:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:26,148 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-01-28 23:38:26,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:38:26,149 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-01-28 23:38:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 23:38:26,149 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:26,149 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:26,149 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:26,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2030631028, now seen corresponding path program 1 times [2018-01-28 23:38:26,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:26,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:26,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:26,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:26,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:26,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:26,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:26,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:38:26,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:38:26,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:38:26,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:38:26,286 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 6 states. [2018-01-28 23:38:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:26,348 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-01-28 23:38:26,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:38:26,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-28 23:38:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:26,350 INFO L225 Difference]: With dead ends: 88 [2018-01-28 23:38:26,350 INFO L226 Difference]: Without dead ends: 87 [2018-01-28 23:38:26,351 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:38:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-28 23:38:26,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-28 23:38:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-28 23:38:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-28 23:38:26,357 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 15 [2018-01-28 23:38:26,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:26,357 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-28 23:38:26,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:38:26,357 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-28 23:38:26,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:38:26,358 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:26,358 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:26,358 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:26,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1474947231, now seen corresponding path program 1 times [2018-01-28 23:38:26,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:26,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:26,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:26,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:26,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:26,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:26,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:26,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:38:26,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:38:26,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:38:26,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:38:26,397 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 4 states. [2018-01-28 23:38:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:26,499 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-28 23:38:26,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:38:26,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-28 23:38:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:26,501 INFO L225 Difference]: With dead ends: 87 [2018-01-28 23:38:26,501 INFO L226 Difference]: Without dead ends: 86 [2018-01-28 23:38:26,501 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:38:26,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-28 23:38:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-28 23:38:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-28 23:38:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-01-28 23:38:26,510 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 16 [2018-01-28 23:38:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:26,510 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-01-28 23:38:26,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:38:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-01-28 23:38:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 23:38:26,511 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:26,511 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:26,511 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1474947229, now seen corresponding path program 1 times [2018-01-28 23:38:26,512 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:26,512 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:26,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:26,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:26,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:26,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:26,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:26,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 23:38:26,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 23:38:26,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 23:38:26,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:38:26,618 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 5 states. [2018-01-28 23:38:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:26,660 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-01-28 23:38:26,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:38:26,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-28 23:38:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:26,662 INFO L225 Difference]: With dead ends: 86 [2018-01-28 23:38:26,662 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 23:38:26,662 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:38:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 23:38:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-28 23:38:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 23:38:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-28 23:38:26,668 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2018-01-28 23:38:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:26,668 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-28 23:38:26,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 23:38:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-28 23:38:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 23:38:26,669 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:26,669 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:26,669 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:26,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1327107281, now seen corresponding path program 1 times [2018-01-28 23:38:26,669 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:26,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:26,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:26,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:26,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:26,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:26,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:26,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 23:38:26,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 23:38:26,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 23:38:26,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 23:38:26,817 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 9 states. [2018-01-28 23:38:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:27,037 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2018-01-28 23:38:27,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 23:38:27,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-28 23:38:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:27,041 INFO L225 Difference]: With dead ends: 134 [2018-01-28 23:38:27,041 INFO L226 Difference]: Without dead ends: 133 [2018-01-28 23:38:27,042 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-28 23:38:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-28 23:38:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 87. [2018-01-28 23:38:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-28 23:38:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-01-28 23:38:27,050 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 22 [2018-01-28 23:38:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:27,050 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-01-28 23:38:27,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 23:38:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-01-28 23:38:27,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 23:38:27,051 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:27,051 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:27,051 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:27,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1327107279, now seen corresponding path program 1 times [2018-01-28 23:38:27,051 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:27,051 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:27,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:27,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:27,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:27,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:27,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-01-28 23:38:27,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:27,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:38:27,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:38:27,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:38:27,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:38:27,107 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 6 states. [2018-01-28 23:38:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:27,194 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-01-28 23:38:27,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:38:27,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-28 23:38:27,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:27,195 INFO L225 Difference]: With dead ends: 88 [2018-01-28 23:38:27,195 INFO L226 Difference]: Without dead ends: 87 [2018-01-28 23:38:27,196 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:38:27,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-28 23:38:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-28 23:38:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-28 23:38:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-28 23:38:27,204 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 22 [2018-01-28 23:38:27,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:27,204 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-28 23:38:27,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:38:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-28 23:38:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 23:38:27,205 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:27,205 INFO L330 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-01-28 23:38:27,206 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:27,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1025456848, now seen corresponding path program 1 times [2018-01-28 23:38:27,206 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:27,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:27,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:27,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:27,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:27,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:27,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:27,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:38:27,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:38:27,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:38:27,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:38:27,336 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-01-28 23:38:27,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:27,476 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-28 23:38:27,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:38:27,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-28 23:38:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:27,477 INFO L225 Difference]: With dead ends: 87 [2018-01-28 23:38:27,477 INFO L226 Difference]: Without dead ends: 72 [2018-01-28 23:38:27,477 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:38:27,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-28 23:38:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-28 23:38:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-28 23:38:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-01-28 23:38:27,482 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 25 [2018-01-28 23:38:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:27,482 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-01-28 23:38:27,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:38:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-01-28 23:38:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 23:38:27,483 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:27,483 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:27,483 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1246839811, now seen corresponding path program 1 times [2018-01-28 23:38:27,483 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:27,483 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:27,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:27,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:27,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:27,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:27,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:27,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:38:27,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:38:27,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:38:27,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:38:27,542 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 6 states. [2018-01-28 23:38:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:27,654 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-01-28 23:38:27,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:38:27,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-28 23:38:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:27,655 INFO L225 Difference]: With dead ends: 80 [2018-01-28 23:38:27,656 INFO L226 Difference]: Without dead ends: 77 [2018-01-28 23:38:27,656 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:38:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-28 23:38:27,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-01-28 23:38:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-28 23:38:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-28 23:38:27,662 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 28 [2018-01-28 23:38:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:27,663 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-28 23:38:27,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:38:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-28 23:38:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 23:38:27,664 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:27,664 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:27,664 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:27,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1246839809, now seen corresponding path program 1 times [2018-01-28 23:38:27,664 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:27,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:27,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:27,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:27,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:27,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:27,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:27,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 23:38:27,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 23:38:27,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 23:38:27,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-28 23:38:27,756 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 9 states. [2018-01-28 23:38:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:27,840 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2018-01-28 23:38:27,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:38:27,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-28 23:38:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:27,841 INFO L225 Difference]: With dead ends: 107 [2018-01-28 23:38:27,841 INFO L226 Difference]: Without dead ends: 104 [2018-01-28 23:38:27,842 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-28 23:38:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-28 23:38:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2018-01-28 23:38:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 23:38:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-01-28 23:38:27,847 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 28 [2018-01-28 23:38:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:27,847 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-01-28 23:38:27,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 23:38:27,847 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-01-28 23:38:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 23:38:27,848 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:27,848 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:27,849 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:27,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2002285167, now seen corresponding path program 1 times [2018-01-28 23:38:27,849 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:27,849 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:27,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:27,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:27,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:27,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:27,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:27,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:38:27,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 23:38:27,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 23:38:27,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:38:27,914 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 7 states. [2018-01-28 23:38:28,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:28,002 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2018-01-28 23:38:28,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:38:28,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-28 23:38:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:28,004 INFO L225 Difference]: With dead ends: 113 [2018-01-28 23:38:28,004 INFO L226 Difference]: Without dead ends: 112 [2018-01-28 23:38:28,004 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-28 23:38:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-28 23:38:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 83. [2018-01-28 23:38:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 23:38:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-01-28 23:38:28,011 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 32 [2018-01-28 23:38:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:28,012 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-01-28 23:38:28,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 23:38:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-01-28 23:38:28,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 23:38:28,013 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:28,013 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:28,013 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:28,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2002285165, now seen corresponding path program 1 times [2018-01-28 23:38:28,013 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:28,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:28,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:28,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:28,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:28,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:28,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:28,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 23:38:28,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 23:38:28,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 23:38:28,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-28 23:38:28,205 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 9 states. [2018-01-28 23:38:28,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:28,382 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2018-01-28 23:38:28,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 23:38:28,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-28 23:38:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:28,384 INFO L225 Difference]: With dead ends: 155 [2018-01-28 23:38:28,384 INFO L226 Difference]: Without dead ends: 154 [2018-01-28 23:38:28,384 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-01-28 23:38:28,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-28 23:38:28,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 93. [2018-01-28 23:38:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-28 23:38:28,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-01-28 23:38:28,393 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 32 [2018-01-28 23:38:28,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:28,394 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-01-28 23:38:28,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 23:38:28,394 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-01-28 23:38:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 23:38:28,395 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:28,395 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:28,396 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:28,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1956044678, now seen corresponding path program 1 times [2018-01-28 23:38:28,396 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:28,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:28,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:28,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:28,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:28,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:28,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:28,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:38:28,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 23:38:28,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 23:38:28,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 23:38:28,426 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 3 states. [2018-01-28 23:38:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:28,441 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2018-01-28 23:38:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 23:38:28,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-01-28 23:38:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:28,442 INFO L225 Difference]: With dead ends: 150 [2018-01-28 23:38:28,442 INFO L226 Difference]: Without dead ends: 95 [2018-01-28 23:38:28,443 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 23:38:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-28 23:38:28,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-28 23:38:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-28 23:38:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-01-28 23:38:28,450 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 43 [2018-01-28 23:38:28,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:28,450 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-01-28 23:38:28,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 23:38:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-01-28 23:38:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 23:38:28,452 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:28,452 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:28,452 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:28,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1472268510, now seen corresponding path program 1 times [2018-01-28 23:38:28,452 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:28,452 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:28,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:28,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:28,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:28,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:28,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:28,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:38:28,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:38:28,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:38:28,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:38:28,512 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 6 states. [2018-01-28 23:38:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:28,590 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2018-01-28 23:38:28,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:38:28,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-28 23:38:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:28,591 INFO L225 Difference]: With dead ends: 164 [2018-01-28 23:38:28,592 INFO L226 Difference]: Without dead ends: 100 [2018-01-28 23:38:28,592 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-28 23:38:28,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-28 23:38:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-01-28 23:38:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-28 23:38:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-01-28 23:38:28,600 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 43 [2018-01-28 23:38:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:28,601 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-01-28 23:38:28,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:38:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-01-28 23:38:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 23:38:28,602 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:28,602 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:28,602 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash 858527029, now seen corresponding path program 1 times [2018-01-28 23:38:28,602 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:28,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:28,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:28,603 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:28,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:38:28,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:38:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 23:38:28,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:38:28,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:38:28,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:38:28,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:38:28,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:38:28,654 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 4 states. [2018-01-28 23:38:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:38:28,694 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-01-28 23:38:28,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:38:28,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-28 23:38:28,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:38:28,695 INFO L225 Difference]: With dead ends: 99 [2018-01-28 23:38:28,695 INFO L226 Difference]: Without dead ends: 98 [2018-01-28 23:38:28,696 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:38:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-28 23:38:28,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-28 23:38:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-28 23:38:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-01-28 23:38:28,702 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 46 [2018-01-28 23:38:28,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:38:28,702 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-01-28 23:38:28,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:38:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-01-28 23:38:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 23:38:28,702 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:38:28,703 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:38:28,703 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-28 23:38:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash 858527031, now seen corresponding path program 1 times [2018-01-28 23:38:28,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:38:28,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:38:28,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:28,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:38:28,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:38:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:38:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:38:28,754 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 23:38:28,756 INFO L84 mationBacktranslator]: Skipped ATE [409] [409] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{#NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] [2018-01-28 23:38:28,757 INFO L84 mationBacktranslator]: Skipped ATE [415] [415] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:38:28,757 INFO L84 mationBacktranslator]: Skipped ATE [421] [421] mainENTRY-->L556: Formula: (and (<= |v_main_#t~nondet9_1| 2147483647) (<= 0 (+ |v_main_#t~nondet9_1| 2147483648))) InVars {main_#t~nondet9=|v_main_#t~nondet9_1|} OutVars{main_#t~nondet9=|v_main_#t~nondet9_1|} AuxVars[] AssignedVars[] [2018-01-28 23:38:28,757 INFO L84 mationBacktranslator]: Skipped ATE [425] [425] L556-->L556': Formula: (= v_main_~length1~5_1 |v_main_#t~nondet9_2|) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_#t~nondet9=|v_main_#t~nondet9_2|, main_~length1~5=v_main_~length1~5_1} AuxVars[] AssignedVars[main_~length1~5] [2018-01-28 23:38:28,757 INFO L84 mationBacktranslator]: Skipped ATE [429] [429] L556'-->L557: Formula: true InVars {} OutVars{main_#t~nondet9=|v_main_#t~nondet9_3|} AuxVars[] AssignedVars[main_#t~nondet9] [2018-01-28 23:38:28,757 INFO L84 mationBacktranslator]: Skipped ATE [431] [431] L557-->L557': Formula: (and (<= |v_main_#t~nondet10_1| 2147483647) (<= 0 (+ |v_main_#t~nondet10_1| 2147483648))) InVars {main_#t~nondet10=|v_main_#t~nondet10_1|} OutVars{main_#t~nondet10=|v_main_#t~nondet10_1|} AuxVars[] AssignedVars[] [2018-01-28 23:38:28,757 INFO L84 mationBacktranslator]: Skipped ATE [433] [433] L557'-->L557'': Formula: (= v_main_~length2~5_1 |v_main_#t~nondet10_2|) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~length2~5=v_main_~length2~5_1, main_#t~nondet10=|v_main_#t~nondet10_2|} AuxVars[] AssignedVars[main_~length2~5] [2018-01-28 23:38:28,757 INFO L84 mationBacktranslator]: Skipped ATE [435] [435] L557''-->L558: Formula: true InVars {} OutVars{main_#t~nondet10=|v_main_#t~nondet10_3|} AuxVars[] AssignedVars[main_#t~nondet10] [2018-01-28 23:38:28,757 INFO L84 mationBacktranslator]: Skipped ATE [439] [439] L558-->L558'': Formula: (not (< v_main_~length1~5_4 1)) InVars {main_~length1~5=v_main_~length1~5_4} OutVars{main_~length1~5=v_main_~length1~5_4} AuxVars[] AssignedVars[] [2018-01-28 23:38:28,757 INFO L84 mationBacktranslator]: Skipped ATE [445] [445] L558''-->L561': Formula: (not (< v_main_~length2~5_4 1)) InVars {main_~length2~5=v_main_~length2~5_4} OutVars{main_~length2~5=v_main_~length2~5_4} AuxVars[] AssignedVars[] [2018-01-28 23:38:28,757 INFO L84 mationBacktranslator]: Skipped ATE [449] [449] L561'-->L564: Formula: (and (= |v_main_#t~malloc11.offset_1| 0) (= |v_#length_3| (store |v_#length_4| |v_main_#t~malloc11.base_1| v_main_~length1~5_5)) (not (= |v_main_#t~malloc11.base_1| 0)) (= (store |v_#valid_8| |v_main_#t~malloc11.base_1| 1) |v_#valid_7|) (= 0 (select |v_#valid_8| |v_main_#t~malloc11.base_1|))) InVars {#length=|v_#length_4|, #valid=|v_#valid_8|, main_~length1~5=v_main_~length1~5_5} OutVars{#length=|v_#length_3|, main_#t~malloc11.offset=|v_main_#t~malloc11.offset_1|, main_#t~malloc11.base=|v_main_#t~malloc11.base_1|, #valid=|v_#valid_7|, main_~length1~5=v_main_~length1~5_5} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc11.offset, main_#t~malloc11.base] [2018-01-28 23:38:28,758 INFO L84 mationBacktranslator]: Skipped ATE [451] [451] L564-->L565: Formula: (and (= v_main_~nondetString1~5.base_1 |v_main_#t~malloc11.base_2|) (= v_main_~nondetString1~5.offset_1 |v_main_#t~malloc11.offset_2|)) InVars {main_#t~malloc11.base=|v_main_#t~malloc11.base_2|, main_#t~malloc11.offset=|v_main_#t~malloc11.offset_2|} OutVars{main_~nondetString1~5.offset=v_main_~nondetString1~5.offset_1, main_#t~malloc11.offset=|v_main_#t~malloc11.offset_2|, main_#t~malloc11.base=|v_main_#t~malloc11.base_2|, main_~nondetString1~5.base=v_main_~nondetString1~5.base_1} AuxVars[] AssignedVars[main_~nondetString1~5.base, main_~nondetString1~5.offset] [2018-01-28 23:38:28,758 INFO L84 mationBacktranslator]: Skipped ATE [453] [453] L565-->L565': Formula: (and (= (store |v_#length_6| |v_main_#t~malloc12.base_1| v_main_~length2~5_5) |v_#length_5|) (not (= 0 |v_main_#t~malloc12.base_1|)) (= (store |v_#valid_10| |v_main_#t~malloc12.base_1| 1) |v_#valid_9|) (= 0 (select |v_#valid_10| |v_main_#t~malloc12.base_1|)) (= 0 |v_main_#t~malloc12.offset_1|)) InVars {#length=|v_#length_6|, main_~length2~5=v_main_~length2~5_5, #valid=|v_#valid_10|} OutVars{main_#t~malloc12.offset=|v_main_#t~malloc12.offset_1|, #length=|v_#length_5|, main_~length2~5=v_main_~length2~5_5, main_#t~malloc12.base=|v_main_#t~malloc12.base_1|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[main_#t~malloc12.offset, #valid, #length, main_#t~malloc12.base] [2018-01-28 23:38:28,758 INFO L84 mationBacktranslator]: Skipped ATE [455] [455] L565'-->L566: Formula: (and (= v_main_~nondetString2~5.offset_1 |v_main_#t~malloc12.offset_2|) (= v_main_~nondetString2~5.base_1 |v_main_#t~malloc12.base_2|)) InVars {main_#t~malloc12.offset=|v_main_#t~malloc12.offset_2|, main_#t~malloc12.base=|v_main_#t~malloc12.base_2|} OutVars{main_#t~malloc12.offset=|v_main_#t~malloc12.offset_2|, main_~nondetString2~5.offset=v_main_~nondetString2~5.offset_1, main_#t~malloc12.base=|v_main_#t~malloc12.base_2|, main_~nondetString2~5.base=v_main_~nondetString2~5.base_1} AuxVars[] AssignedVars[main_~nondetString2~5.offset, main_~nondetString2~5.base] [2018-01-28 23:38:28,758 INFO L84 mationBacktranslator]: Skipped ATE [457] [457] L566-->L566': Formula: (let ((.cse0 (+ v_main_~nondetString1~5.offset_2 v_main_~length1~5_6))) (and (<= 1 .cse0) (<= .cse0 (select |v_#length_7| v_main_~nondetString1~5.base_2)) (= |v_#memory_int_part_locs_0_locs_0_1| |v_#memory_int_part_locs_0_locs_0_2|) (= 1 (select |v_#valid_11| v_main_~nondetString1~5.base_2)))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_1|, main_~nondetString1~5.base=v_main_~nondetString1~5.base_2, main_~length1~5=v_main_~length1~5_6, #valid=|v_#valid_11|, main_~nondetString1~5.offset=v_main_~nondetString1~5.offset_2, #length=|v_#length_7|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_2|, main_~nondetString1~5.base=v_main_~nondetString1~5.base_2, main_~length1~5=v_main_~length1~5_6, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, main_~nondetString1~5.offset=v_main_~nondetString1~5.offset_2, #length=|v_#length_7|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:38:28,758 INFO L84 mationBacktranslator]: Skipped ATE [463] [463] L566'-->L567: Formula: (let ((.cse0 (+ v_main_~nondetString2~5.offset_2 v_main_~length2~5_6))) (and (= |v_#memory_int_part_locs_0_locs_0_3| |v_#memory_int_part_locs_0_locs_0_4|) (= (select |v_#valid_13| v_main_~nondetString2~5.base_2) 1) (<= 1 .cse0) (<= .cse0 (select |v_#length_9| v_main_~nondetString2~5.base_2)))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_4|, main_~length2~5=v_main_~length2~5_6, #valid=|v_#valid_13|, main_~nondetString2~5.offset=v_main_~nondetString2~5.offset_2, #length=|v_#length_9|, main_~nondetString2~5.base=v_main_~nondetString2~5.base_2} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, main_~length2~5=v_main_~length2~5_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, main_~nondetString2~5.offset=v_main_~nondetString2~5.offset_2, #length=|v_#length_9|, main_~nondetString2~5.base=v_main_~nondetString2~5.base_2} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:38:28,758 INFO L84 mationBacktranslator]: Skipped ATE [471] [471] L567-->substringENTRY: Formula: (and (= |v_substring_#in~t.offsetInParam_1| v_main_~nondetString2~5.offset_5) (= |v_substring_#in~t.baseInParam_1| v_main_~nondetString2~5.base_6) (= |v_substring_#in~s.offsetInParam_1| v_main_~nondetString1~5.offset_5) (= |v_substring_#in~s.baseInParam_1| v_main_~nondetString1~5.base_6)) InVars {main_~nondetString1~5.offset=v_main_~nondetString1~5.offset_5, main_~nondetString2~5.offset=v_main_~nondetString2~5.offset_5, main_~nondetString1~5.base=v_main_~nondetString1~5.base_6, main_~nondetString2~5.base=v_main_~nondetString2~5.base_6} OutVars{substring_#in~t.offset=|v_substring_#in~t.offsetInParam_1|, substring_#in~s.base=|v_substring_#in~s.baseInParam_1|, substring_#in~s.offset=|v_substring_#in~s.offsetInParam_1|, substring_#in~t.base=|v_substring_#in~t.baseInParam_1|} AuxVars[] AssignedVars[substring_#in~t.offset, substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base] [2018-01-28 23:38:28,758 INFO L84 mationBacktranslator]: Skipped ATE [475] [475] substringENTRY-->L540: Formula: (and (= v_substring_~s.base_1 |v_substring_#in~s.base_1|) (= v_substring_~s.offset_1 |v_substring_#in~s.offset_1|)) InVars {substring_#in~s.offset=|v_substring_#in~s.offset_1|, substring_#in~s.base=|v_substring_#in~s.base_1|} OutVars{substring_~s.base=v_substring_~s.base_1, substring_~s.offset=v_substring_~s.offset_1, substring_#in~s.offset=|v_substring_#in~s.offset_1|, substring_#in~s.base=|v_substring_#in~s.base_1|} AuxVars[] AssignedVars[substring_~s.base, substring_~s.offset] [2018-01-28 23:38:28,758 INFO L84 mationBacktranslator]: Skipped ATE [479] [479] L540-->L542: Formula: (and (= v_substring_~t.base_1 |v_substring_#in~t.base_1|) (= v_substring_~t.offset_1 |v_substring_#in~t.offset_1|)) InVars {substring_#in~t.offset=|v_substring_#in~t.offset_1|, substring_#in~t.base=|v_substring_#in~t.base_1|} OutVars{substring_~t.base=v_substring_~t.base_1, substring_~t.offset=v_substring_~t.offset_1, substring_#in~t.offset=|v_substring_#in~t.offset_1|, substring_#in~t.base=|v_substring_#in~t.base_1|} AuxVars[] AssignedVars[substring_~t.offset, substring_~t.base] [2018-01-28 23:38:28,758 INFO L84 mationBacktranslator]: Skipped ATE [483] [483] L542-->L543''''': Formula: (and (= v_substring_~ps~2.base_1 v_substring_~s.base_2) (= v_substring_~ps~2.offset_1 v_substring_~s.offset_2)) InVars {substring_~s.base=v_substring_~s.base_2, substring_~s.offset=v_substring_~s.offset_2} OutVars{substring_~ps~2.offset=v_substring_~ps~2.offset_1, substring_~s.base=v_substring_~s.base_2, substring_~s.offset=v_substring_~s.offset_2, substring_~ps~2.base=v_substring_~ps~2.base_1} AuxVars[] AssignedVars[substring_~ps~2.offset, substring_~ps~2.base] [2018-01-28 23:38:28,758 INFO L84 mationBacktranslator]: Skipped ATE [487] [487] L543'''''-->L543: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:38:28,758 INFO L84 mationBacktranslator]: Skipped ATE [493] [493] L543-->L543': Formula: (and (<= 0 v_substring_~ps~2.offset_2) (= |v_substring_#t~mem0_1| (select (select |v_#memory_int_part_locs_0_locs_0_5| v_substring_~ps~2.base_2) v_substring_~ps~2.offset_2)) (= 1 (select |v_#valid_21| v_substring_~ps~2.base_2)) (<= (+ v_substring_~ps~2.offset_2 1) (select |v_#length_11| v_substring_~ps~2.base_2))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, substring_~ps~2.offset=v_substring_~ps~2.offset_2, #length=|v_#length_11|, substring_~ps~2.base=v_substring_~ps~2.base_2, #valid=|v_#valid_21|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, substring_#t~mem0=|v_substring_#t~mem0_1|, #valid=|v_#valid_21|, substring_~ps~2.offset=v_substring_~ps~2.offset_2, #length=|v_#length_11|, substring_~ps~2.base=v_substring_~ps~2.base_2} AuxVars[] AssignedVars[substring_#t~mem0] [2018-01-28 23:38:28,759 INFO L84 mationBacktranslator]: Skipped ATE [505] [505] L543'-->L543'''': Formula: (not (= 0 |v_substring_#t~mem0_4|)) InVars {substring_#t~mem0=|v_substring_#t~mem0_4|} OutVars{substring_#t~mem0=|v_substring_#t~mem0_4|} AuxVars[] AssignedVars[] [2018-01-28 23:38:28,759 INFO L84 mationBacktranslator]: Skipped ATE [513] [513] L543''''-->L544: Formula: true InVars {} OutVars{substring_#t~mem0=|v_substring_#t~mem0_5|} AuxVars[] AssignedVars[substring_#t~mem0] [2018-01-28 23:38:28,759 INFO L84 mationBacktranslator]: Skipped ATE [519] [519] L544-->L545: Formula: (and (= v_substring_~ps2~3.base_1 v_substring_~ps~2.base_5) (= v_substring_~ps2~3.offset_1 v_substring_~ps~2.offset_4)) InVars {substring_~ps~2.offset=v_substring_~ps~2.offset_4, substring_~ps~2.base=v_substring_~ps~2.base_5} OutVars{substring_~ps~2.offset=v_substring_~ps~2.offset_4, substring_~ps2~3.offset=v_substring_~ps2~3.offset_1, substring_~ps~2.base=v_substring_~ps~2.base_5, substring_~ps2~3.base=v_substring_~ps2~3.base_1} AuxVars[] AssignedVars[substring_~ps2~3.offset, substring_~ps2~3.base] [2018-01-28 23:38:28,759 INFO L84 mationBacktranslator]: Skipped ATE [521] [521] L545-->L546''''''''''''''''': Formula: (and (= v_substring_~pt~3.offset_1 v_substring_~t.offset_2) (= v_substring_~pt~3.base_1 v_substring_~t.base_2)) InVars {substring_~t.base=v_substring_~t.base_2, substring_~t.offset=v_substring_~t.offset_2} OutVars{substring_~t.base=v_substring_~t.base_2, substring_~t.offset=v_substring_~t.offset_2, substring_~pt~3.offset=v_substring_~pt~3.offset_1, substring_~pt~3.base=v_substring_~pt~3.base_1} AuxVars[] AssignedVars[substring_~pt~3.base, substring_~pt~3.offset] [2018-01-28 23:38:28,759 INFO L84 mationBacktranslator]: Skipped ATE [523] [523] L546'''''''''''''''''-->L546: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:38:28,759 INFO L84 mationBacktranslator]: Skipped ATE [527] [527] L546-->L546': Formula: (and (<= (+ v_substring_~pt~3.offset_2 1) (select |v_#length_13| v_substring_~pt~3.base_2)) (= (select (select |v_#memory_int_part_locs_0_locs_0_6| v_substring_~pt~3.base_2) v_substring_~pt~3.offset_2) |v_substring_#t~mem1_1|) (<= 0 v_substring_~pt~3.offset_2) (= 1 (select |v_#valid_23| v_substring_~pt~3.base_2))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_6|, #length=|v_#length_13|, substring_~pt~3.offset=v_substring_~pt~3.offset_2, substring_~pt~3.base=v_substring_~pt~3.base_2, #valid=|v_#valid_23|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_6|, substring_#t~mem1=|v_substring_#t~mem1_1|, substring_~pt~3.base=v_substring_~pt~3.base_2, #valid=|v_#valid_23|, #length=|v_#length_13|, substring_~pt~3.offset=v_substring_~pt~3.offset_2} AuxVars[] AssignedVars[substring_#t~mem1] [2018-01-28 23:38:28,759 INFO L84 mationBacktranslator]: Skipped ATE [539] [539] L546'-->L546'': Formula: (let ((.cse0 (= 0 |v_substring_#t~mem1_2|))) (or (and .cse0 (not |v_substring_#t~short4_1|)) (and (not .cse0) |v_substring_#t~short4_1|))) InVars {substring_#t~mem1=|v_substring_#t~mem1_2|} OutVars{substring_#t~mem1=|v_substring_#t~mem1_2|, substring_#t~short4=|v_substring_#t~short4_1|} AuxVars[] AssignedVars[substring_#t~short4] [2018-01-28 23:38:28,759 INFO L84 mationBacktranslator]: Skipped ATE [545] [545] L546''-->L546''': Formula: |v_substring_#t~short4_2| InVars {substring_#t~short4=|v_substring_#t~short4_2|} OutVars{substring_#t~short4=|v_substring_#t~short4_2|} AuxVars[] AssignedVars[] [2018-01-28 23:38:28,760 INFO L84 mationBacktranslator]: Skipped ATE [553] [553] L546'''-->L546'''': Formula: (and (<= 0 v_substring_~pt~3.offset_4) (= (select (select |v_#memory_int_part_locs_0_locs_0_8| v_substring_~pt~3.base_5) v_substring_~pt~3.offset_4) |v_substring_#t~mem2_1|) (<= (+ v_substring_~pt~3.offset_4 1) (select |v_#length_15| v_substring_~pt~3.base_5)) (= (select |v_#valid_25| v_substring_~pt~3.base_5) 1)) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_8|, #length=|v_#length_15|, substring_~pt~3.offset=v_substring_~pt~3.offset_4, substring_~pt~3.base=v_substring_~pt~3.base_5, #valid=|v_#valid_25|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_8|, substring_#t~mem2=|v_substring_#t~mem2_1|, substring_~pt~3.base=v_substring_~pt~3.base_5, #valid=|v_#valid_25|, #length=|v_#length_15|, substring_~pt~3.offset=v_substring_~pt~3.offset_4} AuxVars[] AssignedVars[substring_#t~mem2] [2018-01-28 23:38:28,760 INFO L84 mationBacktranslator]: Skipped ATE [567] [567] L546''''-->L546''''': Formula: (and (<= (+ v_substring_~ps2~3.offset_2 1) (select |v_#length_17| v_substring_~ps2~3.base_2)) (<= 0 v_substring_~ps2~3.offset_2) (= (select |v_#valid_27| v_substring_~ps2~3.base_2) 1) (= (select (select |v_#memory_int_part_locs_0_locs_0_9| v_substring_~ps2~3.base_2) v_substring_~ps2~3.offset_2) |v_substring_#t~mem3_1|)) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_9|, #length=|v_#length_17|, substring_~ps2~3.offset=v_substring_~ps2~3.offset_2, #valid=|v_#valid_27|, substring_~ps2~3.base=v_substring_~ps2~3.base_2} OutVars{substring_#t~mem3=|v_substring_#t~mem3_1|, #memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_9|, substring_~ps2~3.offset=v_substring_~ps2~3.offset_2, #valid=|v_#valid_27|, #length=|v_#length_17|, substring_~ps2~3.base=v_substring_~ps2~3.base_2} AuxVars[] AssignedVars[substring_#t~mem3] [2018-01-28 23:38:28,760 INFO L84 mationBacktranslator]: Skipped ATE [579] [579] L546'''''-->L546''''''': Formula: (let ((.cse0 (= |v_substring_#t~mem3_2| |v_substring_#t~mem2_2|))) (or (and (not |v_substring_#t~short4_3|) (not .cse0)) (and .cse0 |v_substring_#t~short4_3|))) InVars {substring_#t~mem3=|v_substring_#t~mem3_2|, substring_#t~mem2=|v_substring_#t~mem2_2|} OutVars{substring_#t~mem3=|v_substring_#t~mem3_2|, substring_#t~mem2=|v_substring_#t~mem2_2|, substring_#t~short4=|v_substring_#t~short4_3|} AuxVars[] AssignedVars[substring_#t~short4] [2018-01-28 23:38:28,760 INFO L84 mationBacktranslator]: Skipped ATE [561] [561] L546'''''''-->L546''''''''''''': Formula: |v_substring_#t~short4_7| InVars {substring_#t~short4=|v_substring_#t~short4_7|} OutVars{substring_#t~short4=|v_substring_#t~short4_7|} AuxVars[] AssignedVars[] [2018-01-28 23:38:28,760 INFO L84 mationBacktranslator]: Skipped ATE [575] [575] L546'''''''''''''-->L546'''''''''''''': Formula: true InVars {} OutVars{substring_#t~mem1=|v_substring_#t~mem1_4|} AuxVars[] AssignedVars[substring_#t~mem1] [2018-01-28 23:38:28,760 INFO L84 mationBacktranslator]: Skipped ATE [583] [583] L546''''''''''''''-->L546''''''''''''''': Formula: true InVars {} OutVars{substring_#t~mem2=|v_substring_#t~mem2_4|} AuxVars[] AssignedVars[substring_#t~mem2] [2018-01-28 23:38:28,760 INFO L84 mationBacktranslator]: Skipped ATE [589] [589] L546'''''''''''''''-->L546'''''''''''''''': Formula: true InVars {} OutVars{substring_#t~mem3=|v_substring_#t~mem3_4|} AuxVars[] AssignedVars[substring_#t~mem3] [2018-01-28 23:38:28,760 INFO L84 mationBacktranslator]: Skipped ATE [593] [593] L546''''''''''''''''-->L547: Formula: true InVars {} OutVars{substring_#t~short4=|v_substring_#t~short4_8|} AuxVars[] AssignedVars[substring_#t~short4] [2018-01-28 23:38:28,760 INFO L84 mationBacktranslator]: Skipped ATE [595] [595] L547-->L547': Formula: (and (= |v_substring_#t~post5.base_1| v_substring_~pt~3.base_8) (= |v_substring_#t~post5.offset_1| v_substring_~pt~3.offset_6)) InVars {substring_~pt~3.offset=v_substring_~pt~3.offset_6, substring_~pt~3.base=v_substring_~pt~3.base_8} OutVars{substring_#t~post5.base=|v_substring_#t~post5.base_1|, substring_#t~post5.offset=|v_substring_#t~post5.offset_1|, substring_~pt~3.offset=v_substring_~pt~3.offset_6, substring_~pt~3.base=v_substring_~pt~3.base_8} AuxVars[] AssignedVars[substring_#t~post5.base, substring_#t~post5.offset] [2018-01-28 23:38:28,761 INFO L84 mationBacktranslator]: Skipped ATE [597] [597] L547'-->L547'': Formula: (and (= v_substring_~pt~3.base_9 |v_substring_#t~post5.base_2|) (= v_substring_~pt~3.offset_7 (+ |v_substring_#t~post5.offset_2| 1))) InVars {substring_#t~post5.base=|v_substring_#t~post5.base_2|, substring_#t~post5.offset=|v_substring_#t~post5.offset_2|} OutVars{substring_#t~post5.base=|v_substring_#t~post5.base_2|, substring_#t~post5.offset=|v_substring_#t~post5.offset_2|, substring_~pt~3.offset=v_substring_~pt~3.offset_7, substring_~pt~3.base=v_substring_~pt~3.base_9} AuxVars[] AssignedVars[substring_~pt~3.base, substring_~pt~3.offset] [2018-01-28 23:38:28,761 INFO L84 mationBacktranslator]: Skipped ATE [599] [599] L547''-->L548: Formula: true InVars {} OutVars{substring_#t~post5.base=|v_substring_#t~post5.base_3|, substring_#t~post5.offset=|v_substring_#t~post5.offset_3|} AuxVars[] AssignedVars[substring_#t~post5.base, substring_#t~post5.offset] [2018-01-28 23:38:28,761 INFO L84 mationBacktranslator]: Skipped ATE [601] [601] L548-->L548': Formula: (and (= |v_substring_#t~post6.base_1| v_substring_~ps2~3.base_5) (= |v_substring_#t~post6.offset_1| v_substring_~ps2~3.offset_4)) InVars {substring_~ps2~3.offset=v_substring_~ps2~3.offset_4, substring_~ps2~3.base=v_substring_~ps2~3.base_5} OutVars{substring_#t~post6.offset=|v_substring_#t~post6.offset_1|, substring_#t~post6.base=|v_substring_#t~post6.base_1|, substring_~ps2~3.offset=v_substring_~ps2~3.offset_4, substring_~ps2~3.base=v_substring_~ps2~3.base_5} AuxVars[] AssignedVars[substring_#t~post6.offset, substring_#t~post6.base] [2018-01-28 23:38:28,761 INFO L84 mationBacktranslator]: Skipped ATE [603] [603] L548'-->L548'': Formula: (and (= v_substring_~ps2~3.base_6 |v_substring_#t~post6.base_2|) (= v_substring_~ps2~3.offset_5 (+ |v_substring_#t~post6.offset_2| 1))) InVars {substring_#t~post6.base=|v_substring_#t~post6.base_2|, substring_#t~post6.offset=|v_substring_#t~post6.offset_2|} OutVars{substring_#t~post6.offset=|v_substring_#t~post6.offset_2|, substring_~ps2~3.offset=v_substring_~ps2~3.offset_5, substring_#t~post6.base=|v_substring_#t~post6.base_2|, substring_~ps2~3.base=v_substring_~ps2~3.base_6} AuxVars[] AssignedVars[substring_~ps2~3.offset, substring_~ps2~3.base] [2018-01-28 23:38:28,761 INFO L84 mationBacktranslator]: Skipped ATE [605] [605] L548''-->L546''''''''''''''''': Formula: true InVars {} OutVars{substring_#t~post6.base=|v_substring_#t~post6.base_3|, substring_#t~post6.offset=|v_substring_#t~post6.offset_3|} AuxVars[] AssignedVars[substring_#t~post6.offset, substring_#t~post6.base] [2018-01-28 23:38:28,761 INFO L84 mationBacktranslator]: Skipped ATE [523] [523] L546'''''''''''''''''-->L546: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:38:28,761 INFO L84 mationBacktranslator]: Skipped ATE [531] [531] L546-->substringErr3RequiresViolation: Formula: (or (not (<= (+ v_substring_~pt~3.offset_3 1) (select |v_#length_14| v_substring_~pt~3.base_4))) (not (<= 0 v_substring_~pt~3.offset_3))) InVars {#length=|v_#length_14|, substring_~pt~3.offset=v_substring_~pt~3.offset_3, substring_~pt~3.base=v_substring_~pt~3.base_4} OutVars{#length=|v_#length_14|, substring_~pt~3.offset=v_substring_~pt~3.offset_3, substring_~pt~3.base=v_substring_~pt~3.base_4} AuxVars[] AssignedVars[] [2018-01-28 23:38:28,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:38:28 BasicIcfg [2018-01-28 23:38:28,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 23:38:28,767 INFO L168 Benchmark]: Toolchain (without parser) took 47192.75 ms. Allocated memory was 304.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 263.1 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 416.5 MB. Max. memory is 5.3 GB. [2018-01-28 23:38:28,767 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 304.1 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:38:28,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.46 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 253.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:38:28,768 INFO L168 Benchmark]: Boogie Preprocessor took 38.03 ms. Allocated memory is still 304.1 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:38:28,768 INFO L168 Benchmark]: RCFGBuilder took 320.46 ms. Allocated memory is still 304.1 MB. Free memory was 251.2 MB in the beginning and 228.6 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-01-28 23:38:28,768 INFO L168 Benchmark]: IcfgTransformer took 43469.03 ms. Allocated memory was 304.1 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 228.6 MB in the beginning and 744.2 MB in the end (delta: -515.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-28 23:38:28,769 INFO L168 Benchmark]: TraceAbstraction took 3149.50 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 98.6 MB). Free memory was 744.2 MB in the beginning and 1.8 GB in the end (delta: -1.1 GB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:38:28,771 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.12 ms. Allocated memory is still 304.1 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.46 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 253.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.03 ms. Allocated memory is still 304.1 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 320.46 ms. Allocated memory is still 304.1 MB. Free memory was 251.2 MB in the beginning and 228.6 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * IcfgTransformer took 43469.03 ms. Allocated memory was 304.1 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 228.6 MB in the beginning and 744.2 MB in the end (delta: -515.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. * TraceAbstraction took 3149.50 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 98.6 MB). Free memory was 744.2 MB in the beginning and 1.8 GB in the end (delta: -1.1 GB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 84 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 1669 LocStat_NO_SUPPORTING_DISEQUALITIES : 640 LocStat_NO_DISJUNCTIONS : -168 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 111 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 133 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 118 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 5.033090 RENAME_VARIABLES(MILLISECONDS) : 0.221517 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.494481 PROJECTAWAY(MILLISECONDS) : 0.065586 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.053244 DISJOIN(MILLISECONDS) : 0.269551 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.238933 ADD_EQUALITY(MILLISECONDS) : 0.007252 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.044598 #CONJOIN_DISJUNCTIVE : 1994 #RENAME_VARIABLES : 4452 #UNFREEZE : 0 #CONJOIN : 2700 #PROJECTAWAY : 2483 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 462 #RENAME_VARIABLES_DISJUNCTIVE : 4270 #ADD_EQUALITY : 135 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 14 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics 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] : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 15 error locations. UNSAFE Result, 3.0s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1021 SDtfs, 1681 SDslu, 1956 SDs, 0 SdLazy, 954 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 163 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 369 ConstructedInterpolants, 0 QuantifiedInterpolants, 36325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-28_23-38-28-778.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-28_23-38-28-778.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-28_23-38-28-778.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-28_23-38-28-778.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_23-38-28-778.csv Received shutdown request...