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-1cceb4a [2018-01-30 01:22:27,695 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:22:27,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:22:27,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:22:27,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:22:27,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:22:27,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:22:27,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:22:27,740 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:22:27,741 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:22:27,742 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:22:27,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:22:27,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:22:27,745 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:22:27,746 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:22:27,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:22:27,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:22:27,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:22:27,754 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:22:27,755 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:22:27,758 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:22:27,758 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:22:27,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:22:27,759 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:22:27,760 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:22:27,761 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:22:27,762 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:22:27,762 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:22:27,763 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:22:27,763 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:22:27,763 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:22:27,764 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-30 01:22:27,774 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:22:27,774 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:22:27,775 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:22:27,775 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:22:27,775 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:22:27,775 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:22:27,775 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:22:27,776 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:22:27,776 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:22:27,776 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 01:22:27,777 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:22:27,777 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:22:27,777 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:22:27,777 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 01:22:27,777 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 01:22:27,778 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 01:22:27,778 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:22:27,778 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:22:27,778 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:22:27,778 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:22:27,778 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:22:27,779 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:22:27,779 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:22:27,779 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:22:27,779 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:22:27,779 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:22:27,780 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:22:27,780 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:22:27,780 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:22:27,780 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:22:27,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:22:27,781 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:22:27,781 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:22:27,782 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:22:27,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:22:27,829 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:22:27,833 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:22:27,835 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:22:27,835 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:22:27,836 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-30 01:22:28,010 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:22:28,016 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 01:22:28,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:22:28,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:22:28,021 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:22:28,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:22:28" (1/1) ... [2018-01-30 01:22:28,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@521999d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:22:28, skipping insertion in model container [2018-01-30 01:22:28,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:22:28" (1/1) ... [2018-01-30 01:22:28,039 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:22:28,077 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:22:28,202 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:22:28,224 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:22:28,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:22:28 WrapperNode [2018-01-30 01:22:28,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:22:28,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:22:28,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:22:28,233 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:22:28,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:22:28" (1/1) ... [2018-01-30 01:22:28,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:22:28" (1/1) ... [2018-01-30 01:22:28,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:22:28" (1/1) ... [2018-01-30 01:22:28,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:22:28" (1/1) ... [2018-01-30 01:22:28,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:22:28" (1/1) ... [2018-01-30 01:22:28,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:22:28" (1/1) ... [2018-01-30 01:22:28,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:22:28" (1/1) ... [2018-01-30 01:22:28,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:22:28,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:22:28,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:22:28,266 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:22:28,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:22:28" (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-30 01:22:28,327 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:22:28,327 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:22:28,327 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-01-30 01:22:28,327 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:22:28,328 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 01:22:28,328 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 01:22:28,328 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 01:22:28,328 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 01:22:28,328 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 01:22:28,328 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:22:28,329 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-01-30 01:22:28,329 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:22:28,329 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:22:28,329 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:22:28,639 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:22:28,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:22:28 BoogieIcfgContainer [2018-01-30 01:22:28,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:22:28,640 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 01:22:28,640 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 01:22:28,641 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 01:22:28,643 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:22:28" (1/1) ... [2018-01-30 01:22:28,650 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 01:22:28,650 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 01:22:28,651 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 01:22:28,699 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 01:22:28,731 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 01:22:28,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 01:23:40,775 INFO L311 AbstractInterpreter]: Visited 102 different actions 1073 times. Merged at 71 different actions 630 times. Widened at 1 different actions 1 times. Found 72 fixpoints after 15 different actions. Largest state had 64 variables. [2018-01-30 01:23:40,778 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 01:23:40,787 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-30 01:23:40,788 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 01:23:40,788 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 01:23:40,788 INFO L244 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-30 01:23:40,818 INFO L547 PartitionManager]: partitioning result: [2018-01-30 01:23:40,818 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 01:23:40,818 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 01:23:40,819 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-30 01:23:40,819 INFO L563 PartitionManager]: # location blocks :3 [2018-01-30 01:23:40,819 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 01:23:40,819 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 01:23:40,819 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 01:23:40,820 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 01:23:40,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:23:40 BasicIcfg [2018-01-30 01:23:40,836 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 01:23:40,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:23:40,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:23:40,892 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:23:40,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:22:28" (1/4) ... [2018-01-30 01:23:40,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afc465b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:23:40, skipping insertion in model container [2018-01-30 01:23:40,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:22:28" (2/4) ... [2018-01-30 01:23:40,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afc465b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:23:40, skipping insertion in model container [2018-01-30 01:23:40,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:22:28" (3/4) ... [2018-01-30 01:23:40,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afc465b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:23:40, skipping insertion in model container [2018-01-30 01:23:40,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:23:40" (4/4) ... [2018-01-30 01:23:40,896 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 01:23:40,902 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:23:40,909 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-30 01:23:40,937 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:23:40,937 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:23:40,938 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:23:40,938 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:23:40,938 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:23:40,938 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:23:40,938 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:23:40,938 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:23:40,939 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:23:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-30 01:23:40,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:23:40,954 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:40,955 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:23:40,955 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:40,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2030631026, now seen corresponding path program 1 times [2018-01-30 01:23:40,959 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:40,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:40,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:40,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:40,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:41,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:41,138 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-30 01:23:41,140 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:41,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:23:41,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:23:41,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:23:41,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:23:41,150 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 4 states. [2018-01-30 01:23:41,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:41,289 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2018-01-30 01:23:41,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:23:41,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-30 01:23:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:41,302 INFO L225 Difference]: With dead ends: 154 [2018-01-30 01:23:41,302 INFO L226 Difference]: Without dead ends: 88 [2018-01-30 01:23:41,306 INFO L553 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-30 01:23:41,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-30 01:23:41,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-30 01:23:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-30 01:23:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-01-30 01:23:41,347 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 15 [2018-01-30 01:23:41,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:41,347 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-01-30 01:23:41,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:23:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-01-30 01:23:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:23:41,348 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:41,349 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:23:41,349 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:41,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2030631028, now seen corresponding path program 1 times [2018-01-30 01:23:41,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:41,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:41,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:41,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:41,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:41,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:41,459 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-30 01:23:41,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:41,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:23:41,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:23:41,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:23:41,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:23:41,462 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 6 states. [2018-01-30 01:23:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:41,548 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-01-30 01:23:41,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:23:41,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-30 01:23:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:41,550 INFO L225 Difference]: With dead ends: 88 [2018-01-30 01:23:41,550 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 01:23:41,551 INFO L553 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-30 01:23:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 01:23:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-30 01:23:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-30 01:23:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-30 01:23:41,559 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 15 [2018-01-30 01:23:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:41,560 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-30 01:23:41,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:23:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-30 01:23:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:23:41,561 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:41,561 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:23:41,561 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:41,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1474947231, now seen corresponding path program 1 times [2018-01-30 01:23:41,562 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:41,562 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:41,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:41,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:41,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:41,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:41,610 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-30 01:23:41,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:41,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:23:41,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:23:41,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:23:41,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:23:41,611 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 4 states. [2018-01-30 01:23:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:41,695 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-30 01:23:41,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:23:41,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-30 01:23:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:41,696 INFO L225 Difference]: With dead ends: 87 [2018-01-30 01:23:41,696 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 01:23:41,697 INFO L553 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-30 01:23:41,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 01:23:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-30 01:23:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-30 01:23:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-01-30 01:23:41,704 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 16 [2018-01-30 01:23:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:41,705 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-01-30 01:23:41,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:23:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-01-30 01:23:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:23:41,706 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:41,706 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:23:41,706 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:41,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1474947229, now seen corresponding path program 1 times [2018-01-30 01:23:41,706 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:41,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:41,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:41,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:41,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:41,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:41,826 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-30 01:23:41,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:41,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:23:41,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:23:41,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:23:41,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:23:41,827 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 5 states. [2018-01-30 01:23:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:41,872 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-01-30 01:23:41,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:23:41,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-30 01:23:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:41,873 INFO L225 Difference]: With dead ends: 86 [2018-01-30 01:23:41,873 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 01:23:41,873 INFO L553 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-30 01:23:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 01:23:41,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-30 01:23:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 01:23:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-30 01:23:41,879 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2018-01-30 01:23:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:41,879 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-30 01:23:41,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:23:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-30 01:23:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 01:23:41,880 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:41,880 INFO L350 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-30 01:23:41,880 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:41,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1327107281, now seen corresponding path program 1 times [2018-01-30 01:23:41,880 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:41,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:41,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:41,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:41,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:41,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:42,018 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-30 01:23:42,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:42,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:23:42,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:23:42,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:23:42,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:23:42,020 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 9 states. [2018-01-30 01:23:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:42,183 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2018-01-30 01:23:42,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 01:23:42,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-30 01:23:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:42,187 INFO L225 Difference]: With dead ends: 134 [2018-01-30 01:23:42,187 INFO L226 Difference]: Without dead ends: 133 [2018-01-30 01:23:42,187 INFO L553 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-30 01:23:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-30 01:23:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 87. [2018-01-30 01:23:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-30 01:23:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-01-30 01:23:42,195 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 22 [2018-01-30 01:23:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:42,196 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-01-30 01:23:42,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:23:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-01-30 01:23:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 01:23:42,197 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:42,197 INFO L350 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-30 01:23:42,197 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1327107279, now seen corresponding path program 1 times [2018-01-30 01:23:42,197 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:42,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:42,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:42,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:42,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:42,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:42,262 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-30 01:23:42,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:42,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:23:42,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:23:42,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:23:42,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:23:42,263 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 6 states. [2018-01-30 01:23:42,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:42,368 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-01-30 01:23:42,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:23:42,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-30 01:23:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:42,369 INFO L225 Difference]: With dead ends: 88 [2018-01-30 01:23:42,370 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 01:23:42,370 INFO L553 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-30 01:23:42,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 01:23:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-30 01:23:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-30 01:23:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-30 01:23:42,377 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 22 [2018-01-30 01:23:42,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:42,377 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-30 01:23:42,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:23:42,377 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-30 01:23:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:23:42,378 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:42,378 INFO L350 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-30 01:23:42,378 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:42,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1025456848, now seen corresponding path program 1 times [2018-01-30 01:23:42,378 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:42,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:42,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:42,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:42,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:42,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:42,496 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-30 01:23:42,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:42,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:23:42,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:23:42,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:23:42,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:23:42,497 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-01-30 01:23:42,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:42,654 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-30 01:23:42,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:23:42,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 01:23:42,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:42,655 INFO L225 Difference]: With dead ends: 87 [2018-01-30 01:23:42,655 INFO L226 Difference]: Without dead ends: 72 [2018-01-30 01:23:42,655 INFO L553 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-30 01:23:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-30 01:23:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-30 01:23:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-30 01:23:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-01-30 01:23:42,660 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 25 [2018-01-30 01:23:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:42,660 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-01-30 01:23:42,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:23:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-01-30 01:23:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 01:23:42,661 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:42,661 INFO L350 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-30 01:23:42,661 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1246839811, now seen corresponding path program 1 times [2018-01-30 01:23:42,662 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:42,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:42,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:42,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:42,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:42,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:42,720 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-30 01:23:42,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:42,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:23:42,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:23:42,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:23:42,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:23:42,721 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 6 states. [2018-01-30 01:23:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:42,851 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-01-30 01:23:42,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:23:42,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-30 01:23:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:42,853 INFO L225 Difference]: With dead ends: 80 [2018-01-30 01:23:42,853 INFO L226 Difference]: Without dead ends: 77 [2018-01-30 01:23:42,853 INFO L553 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-30 01:23:42,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-30 01:23:42,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-01-30 01:23:42,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-30 01:23:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-30 01:23:42,860 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 28 [2018-01-30 01:23:42,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:42,860 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-30 01:23:42,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:23:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-30 01:23:42,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 01:23:42,861 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:42,862 INFO L350 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-30 01:23:42,862 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:42,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1246839809, now seen corresponding path program 1 times [2018-01-30 01:23:42,862 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:42,862 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:42,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:42,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:42,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:42,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:42,963 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-30 01:23:42,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:42,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:23:42,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:23:42,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:23:42,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:23:42,963 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 9 states. [2018-01-30 01:23:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:43,091 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2018-01-30 01:23:43,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:23:43,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-30 01:23:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:43,092 INFO L225 Difference]: With dead ends: 107 [2018-01-30 01:23:43,092 INFO L226 Difference]: Without dead ends: 104 [2018-01-30 01:23:43,093 INFO L553 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-30 01:23:43,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-30 01:23:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2018-01-30 01:23:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 01:23:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-01-30 01:23:43,099 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 28 [2018-01-30 01:23:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:43,099 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-01-30 01:23:43,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:23:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-01-30 01:23:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 01:23:43,100 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:43,100 INFO L350 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-30 01:23:43,100 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2002285167, now seen corresponding path program 1 times [2018-01-30 01:23:43,101 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:43,101 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:43,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:43,102 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:43,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:43,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:43,160 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-30 01:23:43,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:43,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:23:43,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:23:43,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:23:43,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:23:43,161 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 7 states. [2018-01-30 01:23:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:43,248 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2018-01-30 01:23:43,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:23:43,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-30 01:23:43,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:43,249 INFO L225 Difference]: With dead ends: 113 [2018-01-30 01:23:43,249 INFO L226 Difference]: Without dead ends: 112 [2018-01-30 01:23:43,250 INFO L553 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-30 01:23:43,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-30 01:23:43,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 83. [2018-01-30 01:23:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 01:23:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-01-30 01:23:43,255 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 32 [2018-01-30 01:23:43,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:43,255 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-01-30 01:23:43,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:23:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-01-30 01:23:43,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 01:23:43,256 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:43,256 INFO L350 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-30 01:23:43,256 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:43,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2002285165, now seen corresponding path program 1 times [2018-01-30 01:23:43,256 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:43,256 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:43,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:43,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:43,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:43,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:43,399 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-30 01:23:43,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:43,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:23:43,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:23:43,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:23:43,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:23:43,400 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 9 states. [2018-01-30 01:23:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:43,632 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2018-01-30 01:23:43,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 01:23:43,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-30 01:23:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:43,634 INFO L225 Difference]: With dead ends: 155 [2018-01-30 01:23:43,634 INFO L226 Difference]: Without dead ends: 154 [2018-01-30 01:23:43,634 INFO L553 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-30 01:23:43,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-30 01:23:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 93. [2018-01-30 01:23:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-30 01:23:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-01-30 01:23:43,640 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 32 [2018-01-30 01:23:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:43,640 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-01-30 01:23:43,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:23:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-01-30 01:23:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 01:23:43,641 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:43,642 INFO L350 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-30 01:23:43,642 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:43,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1956044678, now seen corresponding path program 1 times [2018-01-30 01:23:43,642 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:43,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:43,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:43,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:43,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:43,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:43,669 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-30 01:23:43,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:43,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:23:43,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:23:43,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:23:43,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:23:43,670 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 3 states. [2018-01-30 01:23:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:43,683 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2018-01-30 01:23:43,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:23:43,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-01-30 01:23:43,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:43,684 INFO L225 Difference]: With dead ends: 150 [2018-01-30 01:23:43,684 INFO L226 Difference]: Without dead ends: 95 [2018-01-30 01:23:43,685 INFO L553 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-30 01:23:43,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-30 01:23:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-30 01:23:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-30 01:23:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-01-30 01:23:43,690 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 43 [2018-01-30 01:23:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:43,690 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-01-30 01:23:43,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:23:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-01-30 01:23:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 01:23:43,691 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:43,691 INFO L350 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-30 01:23:43,691 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1472268510, now seen corresponding path program 1 times [2018-01-30 01:23:43,692 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:43,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:43,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:43,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:43,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:43,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:43,748 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-30 01:23:43,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:43,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:23:43,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:23:43,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:23:43,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:23:43,750 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 6 states. [2018-01-30 01:23:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:43,836 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2018-01-30 01:23:43,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:23:43,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-30 01:23:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:43,837 INFO L225 Difference]: With dead ends: 164 [2018-01-30 01:23:43,837 INFO L226 Difference]: Without dead ends: 100 [2018-01-30 01:23:43,838 INFO L553 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-30 01:23:43,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-30 01:23:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-01-30 01:23:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-30 01:23:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-01-30 01:23:43,845 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 43 [2018-01-30 01:23:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:43,846 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-01-30 01:23:43,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:23:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-01-30 01:23:43,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 01:23:43,847 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:43,847 INFO L350 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-30 01:23:43,847 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash 858527029, now seen corresponding path program 1 times [2018-01-30 01:23:43,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:43,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:43,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:43,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:43,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:43,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:43,905 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-30 01:23:43,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:23:43,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:23:43,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:23:43,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:23:43,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:23:43,907 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 4 states. [2018-01-30 01:23:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:23:43,952 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-01-30 01:23:43,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:23:43,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-30 01:23:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:23:43,953 INFO L225 Difference]: With dead ends: 99 [2018-01-30 01:23:43,953 INFO L226 Difference]: Without dead ends: 98 [2018-01-30 01:23:43,953 INFO L553 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-30 01:23:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-30 01:23:43,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-30 01:23:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-30 01:23:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-01-30 01:23:43,959 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 46 [2018-01-30 01:23:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:23:43,959 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-01-30 01:23:43,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:23:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-01-30 01:23:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 01:23:43,960 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:23:43,960 INFO L350 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-30 01:23:43,960 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-30 01:23:43,960 INFO L82 PathProgramCache]: Analyzing trace with hash 858527031, now seen corresponding path program 1 times [2018-01-30 01:23:43,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:23:43,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:23:43,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:43,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:43,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:23:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:43,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:23:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:23:44,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:23:44,198 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:23:44,205 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:23:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:23:44,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:23:44,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-01-30 01:23:44,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-30 01:23:44,300 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_1 term size 6 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-30 01:23:44,303 INFO L168 Benchmark]: Toolchain (without parser) took 76292.81 ms. Allocated memory was 303.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 263.6 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 577.6 MB. Max. memory is 5.3 GB. [2018-01-30 01:23:44,304 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:23:44,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.51 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 252.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:23:44,305 INFO L168 Benchmark]: Boogie Preprocessor took 33.09 ms. Allocated memory is still 303.6 MB. Free memory was 252.6 MB in the beginning and 250.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-30 01:23:44,305 INFO L168 Benchmark]: RCFGBuilder took 373.89 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 227.9 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-30 01:23:44,305 INFO L168 Benchmark]: IcfgTransformer took 72196.10 ms. Allocated memory was 303.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 227.9 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 100.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:23:44,306 INFO L168 Benchmark]: TraceAbstraction took 3465.75 ms. Allocated memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 76.5 MB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 365.3 MB). Peak memory consumption was 441.8 MB. Max. memory is 5.3 GB. [2018-01-30 01:23:44,308 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.51 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 252.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.09 ms. Allocated memory is still 303.6 MB. Free memory was 252.6 MB in the beginning and 250.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 373.89 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 227.9 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * IcfgTransformer took 72196.10 ms. Allocated memory was 303.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 227.9 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 100.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3465.75 ms. Allocated memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 76.5 MB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 365.3 MB). Peak memory consumption was 441.8 MB. 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 : 2559 LocStat_NO_SUPPORTING_DISEQUALITIES : 1473 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 : 175 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 118 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.163816 RENAME_VARIABLES(MILLISECONDS) : 0.299279 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.556431 PROJECTAWAY(MILLISECONDS) : 0.077851 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.060841 DISJOIN(MILLISECONDS) : 0.377436 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.321641 ADD_EQUALITY(MILLISECONDS) : 0.012292 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007803 #CONJOIN_DISJUNCTIVE : 1572 #RENAME_VARIABLES : 3500 #UNFREEZE : 0 #CONJOIN : 2192 #PROJECTAWAY : 1972 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 410 #RENAME_VARIABLES_DISJUNCTIVE : 3366 #ADD_EQUALITY : 177 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 14 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 2 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: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_1 term size 6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_1 term size 6: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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-30_01-23-44-316.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-30_01-23-44-316.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-30_01-23-44-316.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-30_01-23-44-316.csv Received shutdown request...