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/cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:22:21,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:22:21,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:22:21,685 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:22:21,685 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:22:21,686 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:22:21,687 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:22:21,689 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:22:21,691 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:22:21,692 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:22:21,693 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:22:21,693 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:22:21,696 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:22:21,698 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:22:21,699 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:22:21,711 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:22:21,713 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:22:21,715 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:22:21,716 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:22:21,717 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:22:21,724 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:22:21,725 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:22:21,725 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:22:21,726 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:22:21,727 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:22:21,732 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:22:21,733 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:22:21,734 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:22:21,734 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:22:21,734 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:22:21,735 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:22:21,735 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-31 09:22:21,758 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:22:21,758 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:22:21,759 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:22:21,759 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:22:21,759 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:22:21,760 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:22:21,760 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:22:21,760 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:22:21,760 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:22:21,761 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:22:21,761 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:22:21,762 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:22:21,762 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:22:21,762 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:22:21,762 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:22:21,762 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:22:21,762 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:22:21,763 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:22:21,763 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:22:21,763 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:22:21,763 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:22:21,763 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:22:21,764 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:22:21,764 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:22:21,764 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:22:21,764 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:22:21,764 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:22:21,764 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:22:21,765 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:22:21,765 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:22:21,766 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:22:21,767 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:22:21,767 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:22:21,768 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:22:21,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:22:21,828 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:22:21,834 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:22:21,835 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:22:21,836 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:22:21,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-31 09:22:22,027 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:22:22,038 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:22:22,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:22:22,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:22:22,046 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:22:22,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:22:22" (1/1) ... [2018-01-31 09:22:22,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f4f4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:22, skipping insertion in model container [2018-01-31 09:22:22,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:22:22" (1/1) ... [2018-01-31 09:22:22,071 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:22:22,130 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:22:22,313 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:22:22,346 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:22:22,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:22 WrapperNode [2018-01-31 09:22:22,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:22:22,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:22:22,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:22:22,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:22:22,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:22" (1/1) ... [2018-01-31 09:22:22,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:22" (1/1) ... [2018-01-31 09:22:22,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:22" (1/1) ... [2018-01-31 09:22:22,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:22" (1/1) ... [2018-01-31 09:22:22,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:22" (1/1) ... [2018-01-31 09:22:22,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:22" (1/1) ... [2018-01-31 09:22:22,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:22" (1/1) ... [2018-01-31 09:22:22,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:22:22,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:22:22,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:22:22,406 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:22:22,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:22" (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-31 09:22:22,464 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:22:22,464 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:22:22,464 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-31 09:22:22,464 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:22:22,464 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:22:22,464 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:22:22,465 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:22:22,465 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:22:22,465 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:22:22,465 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:22:22,465 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-31 09:22:22,465 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:22:22,465 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:22:22,466 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:22:23,105 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:22:23,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:22:23 BoogieIcfgContainer [2018-01-31 09:22:23,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:22:23,107 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:22:23,107 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:22:23,108 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:22:23,111 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:22:23" (1/1) ... [2018-01-31 09:22:23,119 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:22:23,119 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:22:23,120 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:22:23,180 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:22:23,217 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:22:23,287 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:23:42,924 INFO L314 AbstractInterpreter]: Visited 115 different actions 917 times. Merged at 80 different actions 491 times. Never widened. Found 66 fixpoints after 11 different actions. Largest state had 63 variables. [2018-01-31 09:23:42,927 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:23:42,940 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-31 09:23:42,940 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:23:42,940 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:23:42,941 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_9| v_cstrncmp_~s1.base_5) v_cstrncmp_~s1.offset_4), at (SUMMARY for call #t~mem4 := read~int(~s1.base, ~s1.offset, 1); srcloc: L546''')) ((select (select |v_#memory_int_11| v_cstrncmp_~s2.base_8) v_cstrncmp_~s2.offset_7), at (SUMMARY for call #t~mem9 := read~int(~s2.base, ~s2.offset, 1); srcloc: L552)) ((select |v_#memory_int_6| v_main_~nondetString2~4.base_2), at (SUMMARY for call write~int(0, ~nondetString2~4.base, ~nondetString2~4.offset + (~length2~4 - 1) * 1, 1); srcloc: L566')) ((select (select |v_#memory_int_7| v_cstrncmp_~s1.base_2) v_cstrncmp_~s1.offset_2), at (SUMMARY for call #t~mem1 := read~int(~s1.base, ~s1.offset, 1); srcloc: L545'''')) ((select (select |v_#memory_int_8| v_cstrncmp_~s2.base_3) v_cstrncmp_~s2.offset_3), at (SUMMARY for call #t~mem2 := read~int(~s2.base, ~s2.offset, 1); srcloc: L545''''')) ((select |v_#memory_int_4| v_main_~nondetString1~4.base_2), at (SUMMARY for call write~int(0, ~nondetString1~4.base, ~nondetString1~4.offset + (~length1~4 - 1) * 1, 1); srcloc: L566)) ((select (select |v_#memory_int_10| v_cstrncmp_~s1.base_10) v_cstrncmp_~s1.offset_8), at (SUMMARY for call #t~mem8 := read~int(~s1.base, ~s1.offset, 1); srcloc: L545''''''''''''''''''')) [2018-01-31 09:23:42,993 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:23:42,993 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:23:42,993 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:23:42,993 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-31 09:23:42,994 INFO L564 PartitionManager]: # location blocks :3 [2018-01-31 09:23:42,994 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:23:42,994 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-31 09:23:42,994 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:23:42,995 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:23:43,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:23:43 BasicIcfg [2018-01-31 09:23:43,040 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:23:43,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:23:43,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:23:43,044 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:23:43,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:22:22" (1/4) ... [2018-01-31 09:23:43,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cadc513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:23:43, skipping insertion in model container [2018-01-31 09:23:43,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:22:22" (2/4) ... [2018-01-31 09:23:43,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cadc513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:23:43, skipping insertion in model container [2018-01-31 09:23:43,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:22:23" (3/4) ... [2018-01-31 09:23:43,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cadc513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:23:43, skipping insertion in model container [2018-01-31 09:23:43,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:23:43" (4/4) ... [2018-01-31 09:23:43,056 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:23:43,152 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:23:43,163 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 09:23:43,212 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:23:43,212 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:23:43,212 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:23:43,212 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:23:43,213 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:23:43,213 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:23:43,213 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:23:43,213 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:23:43,214 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:23:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2018-01-31 09:23:43,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:23:43,236 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:43,237 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:23:43,238 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:43,243 INFO L82 PathProgramCache]: Analyzing trace with hash -858612952, now seen corresponding path program 1 times [2018-01-31 09:23:43,245 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:43,246 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:43,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:43,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:43,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:43,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:43,658 WARN L143 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 15 [2018-01-31 09:23:43,752 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-31 09:23:43,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:23:43,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:23:43,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:23:43,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:23:43,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:23:43,767 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 6 states. [2018-01-31 09:23:44,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:23:44,031 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2018-01-31 09:23:44,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:23:44,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-31 09:23:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:23:44,042 INFO L225 Difference]: With dead ends: 134 [2018-01-31 09:23:44,042 INFO L226 Difference]: Without dead ends: 99 [2018-01-31 09:23:44,047 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:23:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-31 09:23:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-31 09:23:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 09:23:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-01-31 09:23:44,085 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 15 [2018-01-31 09:23:44,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:23:44,085 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-01-31 09:23:44,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:23:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-01-31 09:23:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:23:44,086 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:44,087 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:23:44,087 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:44,087 INFO L82 PathProgramCache]: Analyzing trace with hash -847197343, now seen corresponding path program 1 times [2018-01-31 09:23:44,087 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:44,087 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:44,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:44,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:44,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:44,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:44,168 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-31 09:23:44,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:23:44,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:23:44,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:23:44,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:23:44,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:23:44,171 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 4 states. [2018-01-31 09:23:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:23:44,255 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2018-01-31 09:23:44,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:23:44,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-31 09:23:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:23:44,257 INFO L225 Difference]: With dead ends: 99 [2018-01-31 09:23:44,257 INFO L226 Difference]: Without dead ends: 98 [2018-01-31 09:23:44,258 INFO L554 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-31 09:23:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-31 09:23:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-31 09:23:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 09:23:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-01-31 09:23:44,267 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 16 [2018-01-31 09:23:44,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:23:44,267 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-01-31 09:23:44,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:23:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-01-31 09:23:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:23:44,268 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:44,269 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:23:44,269 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:44,269 INFO L82 PathProgramCache]: Analyzing trace with hash -847197341, now seen corresponding path program 1 times [2018-01-31 09:23:44,269 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:44,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:44,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:44,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:44,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:44,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:44,428 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-31 09:23:44,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:23:44,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:23:44,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:23:44,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:23:44,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:23:44,429 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 5 states. [2018-01-31 09:23:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:23:44,709 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2018-01-31 09:23:44,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:23:44,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-31 09:23:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:23:44,711 INFO L225 Difference]: With dead ends: 98 [2018-01-31 09:23:44,711 INFO L226 Difference]: Without dead ends: 97 [2018-01-31 09:23:44,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:23:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-31 09:23:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-01-31 09:23:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-31 09:23:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-01-31 09:23:44,720 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 16 [2018-01-31 09:23:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:23:44,720 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-01-31 09:23:44,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:23:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-01-31 09:23:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 09:23:44,721 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:44,721 INFO L351 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] [2018-01-31 09:23:44,721 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:44,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2016936630, now seen corresponding path program 1 times [2018-01-31 09:23:44,722 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:44,722 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:44,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:44,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:44,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:44,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:45,008 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 19 DAG size of output 10 [2018-01-31 09:23:45,159 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-31 09:23:45,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:23:45,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:23:45,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:23:45,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:23:45,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:23:45,160 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 6 states. [2018-01-31 09:23:45,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:23:45,587 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-01-31 09:23:45,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:23:45,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-31 09:23:45,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:23:45,588 INFO L225 Difference]: With dead ends: 97 [2018-01-31 09:23:45,588 INFO L226 Difference]: Without dead ends: 74 [2018-01-31 09:23:45,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:23:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-31 09:23:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-31 09:23:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-31 09:23:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-01-31 09:23:45,595 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 27 [2018-01-31 09:23:45,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:23:45,596 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-01-31 09:23:45,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:23:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-01-31 09:23:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-31 09:23:45,597 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:45,597 INFO L351 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] [2018-01-31 09:23:45,597 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:45,598 INFO L82 PathProgramCache]: Analyzing trace with hash -742669783, now seen corresponding path program 1 times [2018-01-31 09:23:45,598 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:45,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:45,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:45,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:45,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:45,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:45,680 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-31 09:23:45,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:23:45,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:23:45,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:23:45,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:23:45,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:23:45,681 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 5 states. [2018-01-31 09:23:45,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:23:45,899 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-01-31 09:23:45,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:23:45,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-31 09:23:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:23:45,901 INFO L225 Difference]: With dead ends: 104 [2018-01-31 09:23:45,902 INFO L226 Difference]: Without dead ends: 101 [2018-01-31 09:23:45,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:23:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-31 09:23:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2018-01-31 09:23:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-31 09:23:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2018-01-31 09:23:45,910 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 30 [2018-01-31 09:23:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:23:45,911 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-01-31 09:23:45,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:23:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2018-01-31 09:23:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-31 09:23:45,912 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:45,912 INFO L351 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] [2018-01-31 09:23:45,912 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:45,912 INFO L82 PathProgramCache]: Analyzing trace with hash -742669781, now seen corresponding path program 1 times [2018-01-31 09:23:45,912 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:45,913 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:45,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:45,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:45,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:45,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:46,126 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-31 09:23:46,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:23:46,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:23:46,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:23:46,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:23:46,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:23:46,127 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 7 states. [2018-01-31 09:23:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:23:46,213 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-01-31 09:23:46,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:23:46,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-31 09:23:46,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:23:46,215 INFO L225 Difference]: With dead ends: 101 [2018-01-31 09:23:46,215 INFO L226 Difference]: Without dead ends: 98 [2018-01-31 09:23:46,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:23:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-31 09:23:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2018-01-31 09:23:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-31 09:23:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-01-31 09:23:46,223 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 30 [2018-01-31 09:23:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:23:46,223 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-01-31 09:23:46,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:23:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-01-31 09:23:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 09:23:46,225 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:46,225 INFO L351 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] [2018-01-31 09:23:46,225 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:46,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1547926246, now seen corresponding path program 1 times [2018-01-31 09:23:46,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:46,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:46,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:46,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:46,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:46,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:23:46,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:23:46,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:23:46,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:23:46,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:23:46,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:23:46,449 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 5 states. [2018-01-31 09:23:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:23:46,511 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-01-31 09:23:46,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:23:46,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-31 09:23:46,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:23:46,512 INFO L225 Difference]: With dead ends: 110 [2018-01-31 09:23:46,512 INFO L226 Difference]: Without dead ends: 108 [2018-01-31 09:23:46,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:23:46,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-31 09:23:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2018-01-31 09:23:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-31 09:23:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-01-31 09:23:46,521 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 31 [2018-01-31 09:23:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:23:46,522 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-01-31 09:23:46,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:23:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-01-31 09:23:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 09:23:46,523 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:46,523 INFO L351 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] [2018-01-31 09:23:46,523 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:46,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1547926244, now seen corresponding path program 1 times [2018-01-31 09:23:46,524 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:46,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:46,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:46,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:46,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:46,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:46,677 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-31 09:23:46,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:23:46,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:23:46,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:23:46,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:23:46,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:23:46,678 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 8 states. [2018-01-31 09:23:46,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:23:46,803 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-01-31 09:23:46,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:23:46,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-31 09:23:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:23:46,804 INFO L225 Difference]: With dead ends: 125 [2018-01-31 09:23:46,804 INFO L226 Difference]: Without dead ends: 115 [2018-01-31 09:23:46,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:23:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-31 09:23:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-01-31 09:23:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 09:23:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-01-31 09:23:46,812 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 31 [2018-01-31 09:23:46,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:23:46,812 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-01-31 09:23:46,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:23:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-01-31 09:23:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-31 09:23:46,814 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:46,814 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:23:46,814 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:46,815 INFO L82 PathProgramCache]: Analyzing trace with hash 459061904, now seen corresponding path program 1 times [2018-01-31 09:23:46,815 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:46,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:46,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:46,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:46,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:46,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:23:46,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:23:46,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:23:46,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:23:46,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:23:46,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:23:46,897 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 3 states. [2018-01-31 09:23:46,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:23:46,937 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2018-01-31 09:23:46,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:23:46,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-01-31 09:23:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:23:46,939 INFO L225 Difference]: With dead ends: 151 [2018-01-31 09:23:46,939 INFO L226 Difference]: Without dead ends: 90 [2018-01-31 09:23:46,940 INFO L554 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-31 09:23:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-31 09:23:46,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-01-31 09:23:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-31 09:23:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-01-31 09:23:46,950 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 51 [2018-01-31 09:23:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:23:46,951 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-01-31 09:23:46,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:23:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-01-31 09:23:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 09:23:46,953 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:46,953 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:23:46,953 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:46,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1192613003, now seen corresponding path program 1 times [2018-01-31 09:23:46,953 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:46,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:46,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:46,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:46,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:46,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:23:47,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:23:47,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:23:47,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:23:47,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:23:47,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:23:47,037 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 3 states. [2018-01-31 09:23:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:23:47,106 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-01-31 09:23:47,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:23:47,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-31 09:23:47,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:23:47,108 INFO L225 Difference]: With dead ends: 142 [2018-01-31 09:23:47,108 INFO L226 Difference]: Without dead ends: 90 [2018-01-31 09:23:47,108 INFO L554 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-31 09:23:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-31 09:23:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-01-31 09:23:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-31 09:23:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-01-31 09:23:47,114 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 54 [2018-01-31 09:23:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:23:47,115 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-01-31 09:23:47,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:23:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-01-31 09:23:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 09:23:47,116 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:47,116 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:23:47,116 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:47,116 INFO L82 PathProgramCache]: Analyzing trace with hash 147841929, now seen corresponding path program 1 times [2018-01-31 09:23:47,117 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:47,117 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:47,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:47,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:47,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:47,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:23:47,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:23:47,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:23:47,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:23:47,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:23:47,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:23:47,194 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 4 states. [2018-01-31 09:23:47,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:23:47,228 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-01-31 09:23:47,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:23:47,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-01-31 09:23:47,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:23:47,230 INFO L225 Difference]: With dead ends: 90 [2018-01-31 09:23:47,230 INFO L226 Difference]: Without dead ends: 88 [2018-01-31 09:23:47,230 INFO L554 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-31 09:23:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-31 09:23:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-31 09:23:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 09:23:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-01-31 09:23:47,235 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 56 [2018-01-31 09:23:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:23:47,235 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-01-31 09:23:47,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:23:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-01-31 09:23:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 09:23:47,237 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:47,237 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:23:47,237 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:47,237 INFO L82 PathProgramCache]: Analyzing trace with hash 147841931, now seen corresponding path program 1 times [2018-01-31 09:23:47,237 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:47,237 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:47,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:47,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:47,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:47,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:23:47,786 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:23:47,786 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-31 09:23:47,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:47,840 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:23:47,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-31 09:23:47,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:23:48,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:23:48,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-01-31 09:23:48,073 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 13 treesize of output 11 [2018-01-31 09:23:48,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-31 09:23:48,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:23:48,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:23:48,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:23:48,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-31 09:23:48,609 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 18 treesize of output 14 [2018-01-31 09:23:48,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 09:23:48,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:23:48,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:23:49,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:23:49,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-31 09:23:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:23:49,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:23:49,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-01-31 09:23:49,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 09:23:49,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 09:23:49,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=367, Unknown=3, NotChecked=0, Total=420 [2018-01-31 09:23:49,301 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 21 states. [2018-01-31 09:23:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:23:50,719 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2018-01-31 09:23:50,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 09:23:50,720 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-01-31 09:23:50,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:23:50,721 INFO L225 Difference]: With dead ends: 150 [2018-01-31 09:23:50,721 INFO L226 Difference]: Without dead ends: 148 [2018-01-31 09:23:50,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=157, Invalid=832, Unknown=3, NotChecked=0, Total=992 [2018-01-31 09:23:50,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-31 09:23:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 117. [2018-01-31 09:23:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-31 09:23:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-01-31 09:23:50,728 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 56 [2018-01-31 09:23:50,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:23:50,728 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-01-31 09:23:50,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 09:23:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-01-31 09:23:50,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-31 09:23:50,729 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:50,729 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:23:50,730 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:50,730 INFO L82 PathProgramCache]: Analyzing trace with hash 288133050, now seen corresponding path program 1 times [2018-01-31 09:23:50,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:50,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:50,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:50,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:50,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:50,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:23:50,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:23:50,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:23:50,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:23:50,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:23:50,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:23:50,903 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 4 states. [2018-01-31 09:23:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:23:50,983 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-01-31 09:23:50,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:23:50,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-01-31 09:23:50,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:23:50,984 INFO L225 Difference]: With dead ends: 117 [2018-01-31 09:23:50,984 INFO L226 Difference]: Without dead ends: 115 [2018-01-31 09:23:50,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:23:50,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-31 09:23:50,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2018-01-31 09:23:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-31 09:23:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-01-31 09:23:50,989 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 57 [2018-01-31 09:23:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:23:50,989 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-01-31 09:23:50,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:23:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-01-31 09:23:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-31 09:23:50,990 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:23:50,990 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:23:50,991 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation]=== [2018-01-31 09:23:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash 288133052, now seen corresponding path program 1 times [2018-01-31 09:23:50,991 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:23:50,991 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:23:50,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:50,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:50,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:23:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:51,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:23:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:23:51,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:23:51,693 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:23:51,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:23:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:23:51,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:23:51,748 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-31 09:23:51,763 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-31 09:23:51,778 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:397) 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-31 09:23:51,781 INFO L168 Benchmark]: Toolchain (without parser) took 89753.84 ms. Allocated memory was 308.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 267.2 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 839.7 MB. Max. memory is 5.3 GB. [2018-01-31 09:23:51,782 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 308.3 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:23:51,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.55 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:23:51,783 INFO L168 Benchmark]: Boogie Preprocessor took 47.54 ms. Allocated memory is still 308.3 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:23:51,783 INFO L168 Benchmark]: RCFGBuilder took 700.55 ms. Allocated memory is still 308.3 MB. Free memory was 255.2 MB in the beginning and 230.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:23:51,786 INFO L168 Benchmark]: IcfgTransformer took 79933.85 ms. Allocated memory was 308.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 230.3 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 24.4 MB. Max. memory is 5.3 GB. [2018-01-31 09:23:51,786 INFO L168 Benchmark]: TraceAbstraction took 8739.43 ms. Allocated memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 31.5 MB). Free memory was 2.1 GB in the beginning and 1.3 GB in the end (delta: 746.9 MB). Peak memory consumption was 778.4 MB. Max. memory is 5.3 GB. [2018-01-31 09:23:51,788 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.11 ms. Allocated memory is still 308.3 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 316.55 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.54 ms. Allocated memory is still 308.3 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 700.55 ms. Allocated memory is still 308.3 MB. Free memory was 255.2 MB in the beginning and 230.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 79933.85 ms. Allocated memory was 308.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 230.3 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 24.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8739.43 ms. Allocated memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 31.5 MB). Free memory was 2.1 GB in the beginning and 1.3 GB in the end (delta: 746.9 MB). Peak memory consumption was 778.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 96 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2622 LocStat_NO_SUPPORTING_DISEQUALITIES : 1678 LocStat_NO_DISJUNCTIONS : -192 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 124 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 185 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 134 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.019455 RENAME_VARIABLES(MILLISECONDS) : 0.536189 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.001007 PROJECTAWAY(MILLISECONDS) : 0.143303 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.040391 DISJOIN(MILLISECONDS) : 0.585226 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.570575 ADD_EQUALITY(MILLISECONDS) : 0.006840 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007657 #CONJOIN_DISJUNCTIVE : 1333 #RENAME_VARIABLES : 2951 #UNFREEZE : 0 #CONJOIN : 1869 #PROJECTAWAY : 1706 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 363 #RENAME_VARIABLES_DISJUNCTIVE : 2843 #ADD_EQUALITY : 187 #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/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_09-23-51-801.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_09-23-51-801.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_09-23-51-801.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_09-23-51-801.csv Received shutdown request...