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/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 01:19:26,781 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:19:26,783 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:19:26,796 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:19:26,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:19:26,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:19:26,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:19:26,800 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:19:26,803 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:19:26,803 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:19:26,804 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:19:26,804 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:19:26,805 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:19:26,805 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:19:26,806 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:19:26,808 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:19:26,810 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:19:26,812 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:19:26,814 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:19:26,815 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:19:26,817 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:19:26,818 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:19:26,818 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:19:26,819 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:19:26,820 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:19:26,821 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:19:26,821 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:19:26,822 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:19:26,822 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:19:26,822 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:19:26,823 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:19:26,823 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 01:19:26,833 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:19:26,833 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:19:26,834 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:19:26,834 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:19:26,835 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:19:26,835 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:19:26,835 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:19:26,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:19:26,836 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:19:26,836 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 01:19:26,836 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:19:26,837 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:19:26,837 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:19:26,837 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 01:19:26,837 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 01:19:26,837 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 01:19:26,838 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:19:26,838 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:19:26,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:19:26,838 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:19:26,838 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:19:26,839 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:19:26,839 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:19:26,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:19:26,839 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:19:26,840 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:19:26,840 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:19:26,840 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:19:26,840 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:19:26,840 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:19:26,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:19:26,841 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:19:26,842 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:19:26,842 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:19:26,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:19:26,890 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:19:26,894 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:19:26,896 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:19:26,896 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:19:26,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-01-30 01:19:27,098 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:19:27,106 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 01:19:27,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:19:27,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:19:27,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:19:27,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:19:27" (1/1) ... [2018-01-30 01:19:27,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e00d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:19:27, skipping insertion in model container [2018-01-30 01:19:27,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:19:27" (1/1) ... [2018-01-30 01:19:27,136 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:19:27,177 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:19:27,292 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:19:27,309 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:19:27,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:19:27 WrapperNode [2018-01-30 01:19:27,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:19:27,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:19:27,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:19:27,319 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:19:27,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:19:27" (1/1) ... [2018-01-30 01:19:27,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:19:27" (1/1) ... [2018-01-30 01:19:27,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:19:27" (1/1) ... [2018-01-30 01:19:27,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:19:27" (1/1) ... [2018-01-30 01:19:27,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:19:27" (1/1) ... [2018-01-30 01:19:27,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:19:27" (1/1) ... [2018-01-30 01:19:27,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:19:27" (1/1) ... [2018-01-30 01:19:27,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:19:27,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:19:27,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:19:27,359 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:19:27,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:19:27" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:19:27,406 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:19:27,406 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:19:27,406 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-30 01:19:27,406 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-30 01:19:27,406 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-01-30 01:19:27,407 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:19:27,407 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 01:19:27,407 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 01:19:27,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 01:19:27,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 01:19:27,407 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 01:19:27,407 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:19:27,407 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-30 01:19:27,407 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-30 01:19:27,407 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-01-30 01:19:27,408 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:19:27,408 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:19:27,408 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:19:27,801 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:19:27,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:19:27 BoogieIcfgContainer [2018-01-30 01:19:27,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:19:27,803 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 01:19:27,803 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 01:19:27,804 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 01:19:27,808 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:19:27" (1/1) ... [2018-01-30 01:19:27,817 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 01:19:27,818 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 01:19:27,818 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 01:19:27,885 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 01:19:27,920 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 01:19:27,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 01:20:46,522 INFO L311 AbstractInterpreter]: Visited 169 different actions 2060 times. Merged at 103 different actions 880 times. Never widened. Found 142 fixpoints after 14 different actions. Largest state had 60 variables. [2018-01-30 01:20:46,524 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 01:20:46,823 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 10 [2018-01-30 01:20:46,823 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 01:20:46,823 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 01:20:46,824 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_11| |v_cstrncmp_#t~pre6.base_2|) |v_cstrncmp_#t~pre6.offset_2|), at (SUMMARY for call #t~mem8 := read~int(#t~pre6.base, #t~pre6.offset, 1); srcloc: L555''')) ((select (select |v_#memory_int_12| |v_cstrncmp_#t~post9.base_3|) |v_cstrncmp_#t~post9.offset_3|), at (SUMMARY for call #t~mem10 := read~int(#t~post9.base, #t~post9.offset, 1); srcloc: L556'')) ((select |v_#memory_int_5| v_main_~nondetString1~10.base_2), at (SUMMARY for call write~int(0, ~nondetString1~10.base, ~nondetString1~10.offset + (~length1~10 - 1) * 1, 1); srcloc: L589)) ((select (select |v_#memory_int_13| |v_cstrstr_#t~post11.base_3|) |v_cstrstr_#t~post11.offset_3|), at (SUMMARY for call #t~mem12 := read~int(#t~post11.base, #t~post11.offset, 1); srcloc: L566'')) ((select (select |v_#memory_int_9| |v_cstrncmp_#t~post3.base_3|) |v_cstrncmp_#t~post3.offset_3|), at (SUMMARY for call #t~mem5 := read~int(#t~post3.base, #t~post3.offset, 1); srcloc: L554''')) ((select (select |v_#memory_int_10| v_cstrncmp_~s1.base_5) v_cstrncmp_~s1.offset_4), at (SUMMARY for call #t~mem7 := read~int(~s1.base, ~s1.offset, 1); srcloc: L555)) ((select |v_#memory_int_7| v_main_~nondetString2~10.base_2), at (SUMMARY for call write~int(0, ~nondetString2~10.base, ~nondetString2~10.offset + (~length2~10 - 1) * 1, 1); srcloc: L589')) ((select (select |v_#memory_int_1| v_cstrlen_~s~2.base_3) v_cstrlen_~s~2.offset_3), at (SUMMARY for call #t~mem1 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L544')) ((select (select |v_#memory_int_14| |v_cstrstr_#t~post15.base_3|) |v_cstrstr_#t~post15.offset_3|), at (SUMMARY for call #t~mem16 := read~int(#t~post15.base, #t~post15.offset, 1); srcloc: L570'')) ((select (select |v_#memory_int_8| v_cstrncmp_~s1.base_2) v_cstrncmp_~s1.offset_2), at (SUMMARY for call #t~mem4 := read~int(~s1.base, ~s1.offset, 1); srcloc: L554)) [2018-01-30 01:20:46,898 INFO L547 PartitionManager]: partitioning result: [2018-01-30 01:20:46,898 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 01:20:46,898 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 01:20:46,898 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-30 01:20:46,898 INFO L563 PartitionManager]: # location blocks :3 [2018-01-30 01:20:46,898 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 01:20:46,899 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 01:20:46,899 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 01:20:46,899 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 01:20:46,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:20:46 BasicIcfg [2018-01-30 01:20:46,921 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 01:20:46,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:20:46,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:20:46,925 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:20:46,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:19:27" (1/4) ... [2018-01-30 01:20:46,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d7e9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:20:46, skipping insertion in model container [2018-01-30 01:20:46,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:19:27" (2/4) ... [2018-01-30 01:20:46,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d7e9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:20:46, skipping insertion in model container [2018-01-30 01:20:46,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:19:27" (3/4) ... [2018-01-30 01:20:46,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d7e9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:20:46, skipping insertion in model container [2018-01-30 01:20:46,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:20:46" (4/4) ... [2018-01-30 01:20:46,928 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 01:20:46,935 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:20:46,942 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-30 01:20:46,972 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:20:46,973 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:20:46,973 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:20:46,973 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:20:46,973 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:20:46,973 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:20:46,973 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:20:46,973 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:20:46,974 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:20:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2018-01-30 01:20:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:20:46,991 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:46,991 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:46,992 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-30 01:20:46,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1957478658, now seen corresponding path program 1 times [2018-01-30 01:20:46,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:46,997 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:47,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:47,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:47,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:47,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:47,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:47,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:20:47,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:20:47,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:20:47,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:20:47,210 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 4 states. [2018-01-30 01:20:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:47,341 INFO L93 Difference]: Finished difference Result 243 states and 273 transitions. [2018-01-30 01:20:47,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:20:47,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-30 01:20:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:47,352 INFO L225 Difference]: With dead ends: 243 [2018-01-30 01:20:47,352 INFO L226 Difference]: Without dead ends: 146 [2018-01-30 01:20:47,355 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:20:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-30 01:20:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-01-30 01:20:47,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-30 01:20:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2018-01-30 01:20:47,395 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 15 [2018-01-30 01:20:47,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:47,396 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2018-01-30 01:20:47,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:20:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2018-01-30 01:20:47,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:20:47,397 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:47,397 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:47,397 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-30 01:20:47,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1957478656, now seen corresponding path program 1 times [2018-01-30 01:20:47,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:47,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:47,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:47,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:47,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:47,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:47,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:47,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:20:47,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:20:47,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:20:47,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:20:47,663 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand 6 states. [2018-01-30 01:20:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:47,788 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-01-30 01:20:47,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:20:47,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-30 01:20:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:47,791 INFO L225 Difference]: With dead ends: 146 [2018-01-30 01:20:47,791 INFO L226 Difference]: Without dead ends: 145 [2018-01-30 01:20:47,792 INFO L553 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-30 01:20:47,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-30 01:20:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-01-30 01:20:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-30 01:20:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 159 transitions. [2018-01-30 01:20:47,805 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 159 transitions. Word has length 15 [2018-01-30 01:20:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:47,805 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 159 transitions. [2018-01-30 01:20:47,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:20:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 159 transitions. [2018-01-30 01:20:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:20:47,806 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:47,806 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:47,806 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-30 01:20:47,807 INFO L82 PathProgramCache]: Analyzing trace with hash -552295583, now seen corresponding path program 1 times [2018-01-30 01:20:47,807 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:47,807 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:47,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:47,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:47,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:47,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:47,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:47,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:20:47,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:20:47,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:20:47,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:20:47,849 INFO L87 Difference]: Start difference. First operand 145 states and 159 transitions. Second operand 4 states. [2018-01-30 01:20:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:47,941 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2018-01-30 01:20:47,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:20:47,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-30 01:20:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:47,942 INFO L225 Difference]: With dead ends: 145 [2018-01-30 01:20:47,942 INFO L226 Difference]: Without dead ends: 144 [2018-01-30 01:20:47,943 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:20:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-30 01:20:47,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-01-30 01:20:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-30 01:20:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2018-01-30 01:20:47,949 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 16 [2018-01-30 01:20:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:47,950 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2018-01-30 01:20:47,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:20:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2018-01-30 01:20:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:20:47,950 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:47,950 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:47,951 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-30 01:20:47,951 INFO L82 PathProgramCache]: Analyzing trace with hash -552295581, now seen corresponding path program 1 times [2018-01-30 01:20:47,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:47,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:47,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:47,952 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:47,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:47,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:48,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:48,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:20:48,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:20:48,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:20:48,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:20:48,045 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand 5 states. [2018-01-30 01:20:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:48,106 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2018-01-30 01:20:48,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:20:48,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-30 01:20:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:48,109 INFO L225 Difference]: With dead ends: 144 [2018-01-30 01:20:48,109 INFO L226 Difference]: Without dead ends: 143 [2018-01-30 01:20:48,110 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:20:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-30 01:20:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-01-30 01:20:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-30 01:20:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-01-30 01:20:48,121 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 16 [2018-01-30 01:20:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:48,121 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-01-30 01:20:48,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:20:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-01-30 01:20:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 01:20:48,122 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:48,122 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:48,123 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-30 01:20:48,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1924756721, now seen corresponding path program 1 times [2018-01-30 01:20:48,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:48,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:48,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:48,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:48,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:48,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:48,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:48,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:20:48,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:20:48,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:20:48,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:20:48,255 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 6 states. [2018-01-30 01:20:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:48,662 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2018-01-30 01:20:48,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:20:48,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-30 01:20:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:48,664 INFO L225 Difference]: With dead ends: 143 [2018-01-30 01:20:48,664 INFO L226 Difference]: Without dead ends: 123 [2018-01-30 01:20:48,664 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:20:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-30 01:20:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-30 01:20:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-30 01:20:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-01-30 01:20:48,673 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 24 [2018-01-30 01:20:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:48,673 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-01-30 01:20:48,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:20:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-01-30 01:20:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:20:48,674 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:48,674 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:48,674 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-30 01:20:48,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1242802996, now seen corresponding path program 1 times [2018-01-30 01:20:48,675 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:48,675 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:48,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:48,676 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:48,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:48,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:48,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:48,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:20:48,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:20:48,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:20:48,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:20:48,737 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 6 states. [2018-01-30 01:20:48,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:48,844 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2018-01-30 01:20:48,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:20:48,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 01:20:48,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:48,845 INFO L225 Difference]: With dead ends: 123 [2018-01-30 01:20:48,846 INFO L226 Difference]: Without dead ends: 122 [2018-01-30 01:20:48,846 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:20:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-30 01:20:48,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-01-30 01:20:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-30 01:20:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-01-30 01:20:48,855 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 25 [2018-01-30 01:20:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:48,855 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-01-30 01:20:48,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:20:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-01-30 01:20:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:20:48,856 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:48,856 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:48,857 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-30 01:20:48,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1242802998, now seen corresponding path program 1 times [2018-01-30 01:20:48,857 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:48,857 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:48,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:48,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:48,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:48,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:48,982 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:48,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:20:48,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:20:48,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:20:48,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:20:48,983 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 9 states. [2018-01-30 01:20:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:49,112 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-01-30 01:20:49,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:20:49,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-30 01:20:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:49,113 INFO L225 Difference]: With dead ends: 122 [2018-01-30 01:20:49,113 INFO L226 Difference]: Without dead ends: 121 [2018-01-30 01:20:49,113 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-30 01:20:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-30 01:20:49,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-30 01:20:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-30 01:20:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-01-30 01:20:49,120 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 25 [2018-01-30 01:20:49,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:49,120 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-01-30 01:20:49,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:20:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2018-01-30 01:20:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 01:20:49,122 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:49,122 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:49,122 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-30 01:20:49,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1437856882, now seen corresponding path program 1 times [2018-01-30 01:20:49,122 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:49,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:49,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:49,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:49,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:49,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:49,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:49,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:20:49,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:20:49,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:20:49,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:20:49,284 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 9 states. [2018-01-30 01:20:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:49,429 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-01-30 01:20:49,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:20:49,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-30 01:20:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:49,463 INFO L225 Difference]: With dead ends: 121 [2018-01-30 01:20:49,463 INFO L226 Difference]: Without dead ends: 120 [2018-01-30 01:20:49,463 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-30 01:20:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-30 01:20:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-30 01:20:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-30 01:20:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2018-01-30 01:20:49,468 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 35 [2018-01-30 01:20:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:49,469 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2018-01-30 01:20:49,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:20:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2018-01-30 01:20:49,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 01:20:49,469 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:49,470 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:49,470 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-30 01:20:49,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1437856884, now seen corresponding path program 1 times [2018-01-30 01:20:49,470 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:49,470 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:49,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:49,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:49,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:49,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:49,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:49,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-30 01:20:49,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 01:20:49,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 01:20:49,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-01-30 01:20:49,742 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 16 states. [2018-01-30 01:20:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:50,287 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2018-01-30 01:20:50,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 01:20:50,288 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-01-30 01:20:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:50,291 INFO L225 Difference]: With dead ends: 131 [2018-01-30 01:20:50,291 INFO L226 Difference]: Without dead ends: 130 [2018-01-30 01:20:50,292 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-01-30 01:20:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-30 01:20:50,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2018-01-30 01:20:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-30 01:20:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-01-30 01:20:50,299 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 35 [2018-01-30 01:20:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:50,299 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-01-30 01:20:50,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 01:20:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-01-30 01:20:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 01:20:50,301 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:50,301 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:50,301 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-30 01:20:50,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2069186972, now seen corresponding path program 1 times [2018-01-30 01:20:50,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:50,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:50,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:50,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:50,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:50,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:50,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:50,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:20:50,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:20:50,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:20:50,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:20:50,360 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 6 states. [2018-01-30 01:20:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:50,468 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-01-30 01:20:50,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:20:50,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-01-30 01:20:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:50,469 INFO L225 Difference]: With dead ends: 122 [2018-01-30 01:20:50,469 INFO L226 Difference]: Without dead ends: 121 [2018-01-30 01:20:50,470 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:20:50,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-30 01:20:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-30 01:20:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-30 01:20:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-01-30 01:20:50,475 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 37 [2018-01-30 01:20:50,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:50,475 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-01-30 01:20:50,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:20:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2018-01-30 01:20:50,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 01:20:50,476 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:50,477 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:50,477 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-30 01:20:50,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2069186974, now seen corresponding path program 1 times [2018-01-30 01:20:50,477 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:50,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:50,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:50,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:50,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:50,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:50,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:20:50,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:20:50,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:20:50,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:20:50,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:20:50,597 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 9 states. [2018-01-30 01:20:50,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:20:50,751 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-01-30 01:20:50,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 01:20:50,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-30 01:20:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:20:50,752 INFO L225 Difference]: With dead ends: 130 [2018-01-30 01:20:50,752 INFO L226 Difference]: Without dead ends: 129 [2018-01-30 01:20:50,753 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-01-30 01:20:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-30 01:20:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-01-30 01:20:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-30 01:20:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2018-01-30 01:20:50,759 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 37 [2018-01-30 01:20:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:20:50,759 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2018-01-30 01:20:50,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:20:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2018-01-30 01:20:50,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 01:20:50,760 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:20:50,761 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:20:50,761 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-30 01:20:50,761 INFO L82 PathProgramCache]: Analyzing trace with hash -450846233, now seen corresponding path program 1 times [2018-01-30 01:20:50,761 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:20:50,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:20:50,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:50,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:50,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:20:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:50,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:20:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:20:51,308 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:20:51,308 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:20:51,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:20:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:20:51,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:20:51,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:20:51,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:20:51,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:20:51,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 01:20:51,447 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 15 treesize of output 13 [2018-01-30 01:20:51,450 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 13 treesize of output 16 [2018-01-30 01:20:51,455 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_1 term size 6 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-30 01:20:51,458 INFO L168 Benchmark]: Toolchain (without parser) took 84359.37 ms. Allocated memory was 307.2 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 267.3 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 911.2 MB. Max. memory is 5.3 GB. [2018-01-30 01:20:51,459 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:20:51,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.12 ms. Allocated memory is still 307.2 MB. Free memory was 266.2 MB in the beginning and 255.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:20:51,460 INFO L168 Benchmark]: Boogie Preprocessor took 39.57 ms. Allocated memory is still 307.2 MB. Free memory was 255.3 MB in the beginning and 253.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:20:51,460 INFO L168 Benchmark]: RCFGBuilder took 443.58 ms. Allocated memory is still 307.2 MB. Free memory was 253.3 MB in the beginning and 222.5 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 5.3 GB. [2018-01-30 01:20:51,460 INFO L168 Benchmark]: IcfgTransformer took 79118.44 ms. Allocated memory was 307.2 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 222.5 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 75.2 MB. Max. memory is 5.3 GB. [2018-01-30 01:20:51,461 INFO L168 Benchmark]: TraceAbstraction took 4535.46 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.3 GB in the end (delta: 791.3 MB). Peak memory consumption was 791.3 MB. Max. memory is 5.3 GB. [2018-01-30 01:20:51,463 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.25 ms. Allocated memory is still 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.12 ms. Allocated memory is still 307.2 MB. Free memory was 266.2 MB in the beginning and 255.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.57 ms. Allocated memory is still 307.2 MB. Free memory was 255.3 MB in the beginning and 253.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 443.58 ms. Allocated memory is still 307.2 MB. Free memory was 253.3 MB in the beginning and 222.5 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 5.3 GB. * IcfgTransformer took 79118.44 ms. Allocated memory was 307.2 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 222.5 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 75.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4535.46 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.3 GB in the end (delta: 791.3 MB). Peak memory consumption was 791.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 139 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 3689 LocStat_NO_SUPPORTING_DISEQUALITIES : 2775 LocStat_NO_DISJUNCTIONS : -278 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 184 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 231 TransStat_NO_SUPPORTING_DISEQUALITIES : 24 TransStat_NO_DISJUNCTIONS : 190 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.561593 RENAME_VARIABLES(MILLISECONDS) : 0.007434 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.900548 PROJECTAWAY(MILLISECONDS) : 0.718761 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.053634 DISJOIN(MILLISECONDS) : 0.355218 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.014923 ADD_EQUALITY(MILLISECONDS) : 0.018358 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009707 #CONJOIN_DISJUNCTIVE : 3286 #RENAME_VARIABLES : 7403 #UNFREEZE : 0 #CONJOIN : 4566 #PROJECTAWAY : 4301 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 1435 #RENAME_VARIABLES_DISJUNCTIVE : 7249 #ADD_EQUALITY : 233 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 22 * 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] : 10 * 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/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_01-20-51-474.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_01-20-51-474.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_01-20-51-474.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_01-20-51-474.csv Received shutdown request...