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/cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:19:42,860 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:19:42,867 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:19:42,891 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:19:42,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:19:42,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:19:42,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:19:42,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:19:42,900 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:19:42,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:19:42,902 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:19:42,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:19:42,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:19:42,905 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:19:42,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:19:42,919 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:19:42,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:19:42,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:19:42,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:19:42,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:19:42,929 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:19:42,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:19:42,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:19:42,930 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:19:42,931 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:19:42,932 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:19:42,932 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:19:42,933 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:19:42,933 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:19:42,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:19:42,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:19:42,934 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:19:42,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:19:42,944 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:19:42,945 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:19:42,945 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:19:42,946 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:19:42,946 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:19:42,946 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:19:42,946 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:19:42,947 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:19:42,947 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:19:42,947 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:19:42,947 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:19:42,947 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:19:42,948 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:19:42,948 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:19:42,948 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:19:42,948 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:19:42,948 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:19:42,949 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:19:42,949 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:19:42,949 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:19:42,949 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:19:42,949 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:19:42,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:19:42,950 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:19:42,950 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:19:42,950 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:19:42,950 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:19:42,950 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:19:42,951 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:19:42,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:19:42,951 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:19:42,952 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:19:42,952 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:19:43,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:19:43,013 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:19:43,015 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:19:43,017 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:19:43,017 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:19:43,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-31 09:19:43,204 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:19:43,212 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:19:43,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:19:43,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:19:43,221 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:19:43,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:19:43" (1/1) ... [2018-01-31 09:19:43,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f4f4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:19:43, skipping insertion in model container [2018-01-31 09:19:43,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:19:43" (1/1) ... [2018-01-31 09:19:43,246 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:19:43,307 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:19:43,491 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:19:43,524 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:19:43,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:19:43 WrapperNode [2018-01-31 09:19:43,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:19:43,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:19:43,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:19:43,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:19:43,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:19:43" (1/1) ... [2018-01-31 09:19:43,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:19:43" (1/1) ... [2018-01-31 09:19:43,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:19:43" (1/1) ... [2018-01-31 09:19:43,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:19:43" (1/1) ... [2018-01-31 09:19:43,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:19:43" (1/1) ... [2018-01-31 09:19:43,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:19:43" (1/1) ... [2018-01-31 09:19:43,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:19:43" (1/1) ... [2018-01-31 09:19:43,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:19:43,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:19:43,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:19:43,579 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:19:43,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:19:43" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:19:43,654 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:19:43,654 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:19:43,654 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-31 09:19:43,655 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:19:43,655 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:19:43,655 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:19:43,655 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:19:43,655 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:19:43,655 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:19:43,656 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:19:43,656 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-31 09:19:43,656 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:19:43,657 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:19:43,658 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:19:44,245 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:19:44,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:19:44 BoogieIcfgContainer [2018-01-31 09:19:44,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:19:44,246 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:19:44,246 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:19:44,248 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:19:44,252 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:19:44" (1/1) ... [2018-01-31 09:19:44,263 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:19:44,263 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:19:44,264 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:19:44,308 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:19:44,345 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:19:44,421 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:21:04,847 INFO L314 AbstractInterpreter]: Visited 96 different actions 874 times. Merged at 65 different actions 517 times. Never widened. Found 41 fixpoints after 6 different actions. Largest state had 59 variables. [2018-01-31 09:21:04,849 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:21:04,861 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-31 09:21:04,862 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:21:04,864 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:21:04,865 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_3| v_cstrcmp_~s2.base_2) v_cstrcmp_~s2.offset_2), at (SUMMARY for call #t~mem2 := read~int(~s2.base, ~s2.offset, 1); srcloc: L543'''')) ((select (select |v_#memory_int_2| v_cstrcmp_~s1.base_5) v_cstrcmp_~s1.offset_4), at (SUMMARY for call #t~mem1 := read~int(~s1.base, ~s1.offset, 1); srcloc: L543''')) ((select |v_#memory_int_11| v_main_~nondetString2~4.base_2), at (SUMMARY for call write~int(0, ~nondetString2~4.base, ~nondetString2~4.offset + (~length2~4 - 1) * 1, 1); srcloc: L562')) ((select (select |v_#memory_int_5| v_cstrcmp_~s2.base_7) v_cstrcmp_~s2.offset_6), at (SUMMARY for call #t~mem7 := read~int(~s2.base, ~s2.offset, 1); srcloc: L548)) ((select (select |v_#memory_int_4| v_cstrcmp_~s1.base_10) v_cstrcmp_~s1.offset_8), at (SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 1); srcloc: L543'''''''''''''''''')) ((select |v_#memory_int_9| v_main_~nondetString1~4.base_2), at (SUMMARY for call write~int(0, ~nondetString1~4.base, ~nondetString1~4.offset + (~length1~4 - 1) * 1, 1); srcloc: L562)) ((select (select |v_#memory_int_1| v_cstrcmp_~s1.base_2) v_cstrcmp_~s1.offset_2), at (SUMMARY for call #t~mem0 := read~int(~s1.base, ~s1.offset, 1); srcloc: L543)) [2018-01-31 09:21:04,908 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:21:04,908 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:21:04,909 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:21:04,909 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-31 09:21:04,909 INFO L564 PartitionManager]: # location blocks :3 [2018-01-31 09:21:04,909 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:21:04,909 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-31 09:21:04,909 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:21:04,910 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:21:04,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:21:04 BasicIcfg [2018-01-31 09:21:04,941 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:21:04,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:21:04,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:21:04,955 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:21:04,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:19:43" (1/4) ... [2018-01-31 09:21:04,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798189d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:21:04, skipping insertion in model container [2018-01-31 09:21:04,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:19:43" (2/4) ... [2018-01-31 09:21:04,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798189d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:21:04, skipping insertion in model container [2018-01-31 09:21:04,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:19:44" (3/4) ... [2018-01-31 09:21:04,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798189d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:21:04, skipping insertion in model container [2018-01-31 09:21:04,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:21:04" (4/4) ... [2018-01-31 09:21:04,958 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:21:05,050 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:21:05,056 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 09:21:05,103 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:21:05,103 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:21:05,104 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:21:05,104 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:21:05,104 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:21:05,104 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:21:05,104 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:21:05,104 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:21:05,105 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:21:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2018-01-31 09:21:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:21:05,124 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:05,125 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:21:05,125 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:05,130 INFO L82 PathProgramCache]: Analyzing trace with hash 721071450, now seen corresponding path program 1 times [2018-01-31 09:21:05,134 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:05,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:05,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:05,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:05,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:05,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:21:05,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:21:05,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:21:05,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:21:05,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:21:05,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:21:05,424 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2018-01-31 09:21:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:21:05,717 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-01-31 09:21:05,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:21:05,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-31 09:21:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:21:05,735 INFO L225 Difference]: With dead ends: 117 [2018-01-31 09:21:05,735 INFO L226 Difference]: Without dead ends: 84 [2018-01-31 09:21:05,739 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:21:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-31 09:21:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-31 09:21:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 09:21:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-31 09:21:05,798 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 15 [2018-01-31 09:21:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:21:05,798 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-31 09:21:05,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:21:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-31 09:21:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:21:05,799 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:05,799 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:21:05,799 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:05,799 INFO L82 PathProgramCache]: Analyzing trace with hash 721071452, now seen corresponding path program 1 times [2018-01-31 09:21:05,799 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:05,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:05,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:05,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:05,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:05,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:21:06,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:21:06,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:21:06,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:21:06,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:21:06,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:21:06,027 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 6 states. [2018-01-31 09:21:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:21:06,214 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-31 09:21:06,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:21:06,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-31 09:21:06,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:21:06,216 INFO L225 Difference]: With dead ends: 84 [2018-01-31 09:21:06,216 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 09:21:06,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:21:06,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 09:21:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-31 09:21:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 09:21:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-01-31 09:21:06,226 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 15 [2018-01-31 09:21:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:21:06,226 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-01-31 09:21:06,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:21:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-01-31 09:21:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:21:06,227 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:06,227 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:21:06,227 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:06,228 INFO L82 PathProgramCache]: Analyzing trace with hash 878378849, now seen corresponding path program 1 times [2018-01-31 09:21:06,228 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:06,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:06,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:06,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:06,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:06,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:21:06,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:21:06,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:21:06,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:21:06,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:21:06,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:21:06,289 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 4 states. [2018-01-31 09:21:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:21:06,370 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-01-31 09:21:06,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:21:06,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-31 09:21:06,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:21:06,372 INFO L225 Difference]: With dead ends: 83 [2018-01-31 09:21:06,372 INFO L226 Difference]: Without dead ends: 82 [2018-01-31 09:21:06,372 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:21:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-31 09:21:06,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-31 09:21:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-31 09:21:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-01-31 09:21:06,380 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 16 [2018-01-31 09:21:06,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:21:06,380 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-01-31 09:21:06,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:21:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-01-31 09:21:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:21:06,381 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:06,381 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:21:06,381 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:06,381 INFO L82 PathProgramCache]: Analyzing trace with hash 878378851, now seen corresponding path program 1 times [2018-01-31 09:21:06,381 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:06,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:06,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:06,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:06,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:06,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:06,719 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 15 DAG size of output 11 [2018-01-31 09:21:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:21:06,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:21:06,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:21:06,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:21:06,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:21:06,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:21:06,721 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 5 states. [2018-01-31 09:21:06,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:21:06,916 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-01-31 09:21:06,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:21:06,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-31 09:21:06,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:21:06,918 INFO L225 Difference]: With dead ends: 82 [2018-01-31 09:21:06,918 INFO L226 Difference]: Without dead ends: 81 [2018-01-31 09:21:06,918 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:21:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-31 09:21:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-31 09:21:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-31 09:21:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-31 09:21:06,926 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 16 [2018-01-31 09:21:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:21:06,927 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-31 09:21:06,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:21:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-31 09:21:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 09:21:06,928 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:06,928 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:21:06,928 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:06,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1680232304, now seen corresponding path program 1 times [2018-01-31 09:21:06,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:06,929 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:06,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:06,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:06,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:06,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:21:06,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:21:06,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:21:06,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:21:06,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:21:06,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:21:06,992 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 5 states. [2018-01-31 09:21:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:21:07,103 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-01-31 09:21:07,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:21:07,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-31 09:21:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:21:07,104 INFO L225 Difference]: With dead ends: 85 [2018-01-31 09:21:07,104 INFO L226 Difference]: Without dead ends: 82 [2018-01-31 09:21:07,105 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:21:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-31 09:21:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-01-31 09:21:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-31 09:21:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-01-31 09:21:07,112 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 23 [2018-01-31 09:21:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:21:07,112 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-01-31 09:21:07,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:21:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-01-31 09:21:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 09:21:07,113 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:07,114 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:21:07,114 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:07,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1680232306, now seen corresponding path program 1 times [2018-01-31 09:21:07,114 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:07,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:07,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:07,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:07,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:07,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:07,549 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 8 DAG size of output 7 [2018-01-31 09:21:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:21:07,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:21:07,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:21:07,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:21:07,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:21:07,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:21:07,580 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 8 states. [2018-01-31 09:21:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:21:07,857 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-01-31 09:21:07,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:21:07,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-31 09:21:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:21:07,861 INFO L225 Difference]: With dead ends: 117 [2018-01-31 09:21:07,861 INFO L226 Difference]: Without dead ends: 114 [2018-01-31 09:21:07,861 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:21:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-31 09:21:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2018-01-31 09:21:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-31 09:21:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-01-31 09:21:07,875 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 23 [2018-01-31 09:21:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:21:07,875 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-01-31 09:21:07,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:21:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-01-31 09:21:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 09:21:07,876 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:07,876 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:21:07,876 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1909331500, now seen corresponding path program 1 times [2018-01-31 09:21:07,877 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:07,877 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:07,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:07,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:07,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:07,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:21:08,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:21:08,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:21:08,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:21:08,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:21:08,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:21:08,114 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 6 states. [2018-01-31 09:21:08,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:21:08,324 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-01-31 09:21:08,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:21:08,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-31 09:21:08,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:21:08,328 INFO L225 Difference]: With dead ends: 92 [2018-01-31 09:21:08,328 INFO L226 Difference]: Without dead ends: 74 [2018-01-31 09:21:08,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:21:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-31 09:21:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-31 09:21:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-31 09:21:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-01-31 09:21:08,335 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 25 [2018-01-31 09:21:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:21:08,336 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-01-31 09:21:08,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:21:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-01-31 09:21:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 09:21:08,337 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:08,337 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:21:08,337 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1096403464, now seen corresponding path program 1 times [2018-01-31 09:21:08,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:08,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:08,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:08,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:08,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:08,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:21:08,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:21:08,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:21:08,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:21:08,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:21:08,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:21:08,394 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 5 states. [2018-01-31 09:21:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:21:08,479 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-01-31 09:21:08,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:21:08,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-31 09:21:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:21:08,481 INFO L225 Difference]: With dead ends: 97 [2018-01-31 09:21:08,481 INFO L226 Difference]: Without dead ends: 95 [2018-01-31 09:21:08,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:21:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-31 09:21:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2018-01-31 09:21:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 09:21:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-01-31 09:21:08,487 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 27 [2018-01-31 09:21:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:21:08,488 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-01-31 09:21:08,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:21:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-01-31 09:21:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 09:21:08,489 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:08,489 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:21:08,489 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:08,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1096403466, now seen corresponding path program 1 times [2018-01-31 09:21:08,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:08,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:08,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:08,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:08,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:08,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:21:08,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:21:08,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:21:08,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:21:08,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:21:08,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:21:08,722 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 8 states. [2018-01-31 09:21:08,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:21:08,823 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-31 09:21:08,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:21:08,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-01-31 09:21:08,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:21:08,824 INFO L225 Difference]: With dead ends: 97 [2018-01-31 09:21:08,824 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 09:21:08,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:21:08,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 09:21:08,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2018-01-31 09:21:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 09:21:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-01-31 09:21:08,828 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 27 [2018-01-31 09:21:08,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:21:08,829 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-01-31 09:21:08,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:21:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-01-31 09:21:08,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 09:21:08,830 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:08,830 INFO L351 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] [2018-01-31 09:21:08,830 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:08,831 INFO L82 PathProgramCache]: Analyzing trace with hash -304279865, now seen corresponding path program 1 times [2018-01-31 09:21:08,831 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:08,831 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:08,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:08,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:08,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:08,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:21:08,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:21:08,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:21:08,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:21:08,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:21:08,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:21:08,875 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 3 states. [2018-01-31 09:21:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:21:08,886 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2018-01-31 09:21:08,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:21:08,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-01-31 09:21:08,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:21:08,887 INFO L225 Difference]: With dead ends: 122 [2018-01-31 09:21:08,887 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 09:21:08,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:21:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 09:21:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-31 09:21:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 09:21:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-31 09:21:08,892 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 38 [2018-01-31 09:21:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:21:08,892 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-31 09:21:08,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:21:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-31 09:21:08,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 09:21:08,893 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:08,894 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:21:08,894 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:08,894 INFO L82 PathProgramCache]: Analyzing trace with hash -326843980, now seen corresponding path program 1 times [2018-01-31 09:21:08,894 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:08,894 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:08,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:08,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:08,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:08,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 09:21:09,265 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:21:09,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:21:09,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:21:09,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:21:09,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:21:09,266 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 6 states. [2018-01-31 09:21:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:21:09,401 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-31 09:21:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:21:09,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-01-31 09:21:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:21:09,403 INFO L225 Difference]: With dead ends: 78 [2018-01-31 09:21:09,403 INFO L226 Difference]: Without dead ends: 77 [2018-01-31 09:21:09,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:21:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-31 09:21:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-31 09:21:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-31 09:21:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-31 09:21:09,407 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 41 [2018-01-31 09:21:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:21:09,408 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-31 09:21:09,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:21:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-31 09:21:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 09:21:09,409 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:09,409 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:21:09,409 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash -326843978, now seen corresponding path program 1 times [2018-01-31 09:21:09,410 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:09,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:09,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:09,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:09,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:09,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:09,668 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-31 09:21:09,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:21:09,668 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:21:09,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:09,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:21:09,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-31 09:21:09,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:21:09,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:21:09,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-01-31 09:21:10,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-31 09:21:10,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-31 09:21:10,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:21:10,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:21:10,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:21:10,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-31 09:21:10,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-31 09:21:10,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 09:21:10,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:21:10,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:21:10,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:21:10,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-31 09:21:10,943 WARN L146 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 17 DAG size of output 17 [2018-01-31 09:21:11,142 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-31 09:21:11,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:21:11,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-31 09:21:11,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 09:21:11,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 09:21:11,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=365, Unknown=3, NotChecked=0, Total=420 [2018-01-31 09:21:11,164 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 21 states. [2018-01-31 09:21:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:21:12,728 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2018-01-31 09:21:12,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 09:21:12,728 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-01-31 09:21:12,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:21:12,729 INFO L225 Difference]: With dead ends: 125 [2018-01-31 09:21:12,729 INFO L226 Difference]: Without dead ends: 122 [2018-01-31 09:21:12,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=158, Invalid=831, Unknown=3, NotChecked=0, Total=992 [2018-01-31 09:21:12,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-31 09:21:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2018-01-31 09:21:12,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-31 09:21:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2018-01-31 09:21:12,736 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 41 [2018-01-31 09:21:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:21:12,736 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2018-01-31 09:21:12,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 09:21:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2018-01-31 09:21:12,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:21:12,738 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:12,738 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:21:12,738 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:12,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1259505076, now seen corresponding path program 1 times [2018-01-31 09:21:12,738 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:12,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:12,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:12,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:12,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:12,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:21:12,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:21:12,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:21:12,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:21:12,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:21:12,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:21:12,788 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 4 states. [2018-01-31 09:21:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:21:12,840 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-31 09:21:12,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:21:12,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-01-31 09:21:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:21:12,841 INFO L225 Difference]: With dead ends: 106 [2018-01-31 09:21:12,841 INFO L226 Difference]: Without dead ends: 104 [2018-01-31 09:21:12,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:21:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-31 09:21:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2018-01-31 09:21:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-31 09:21:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2018-01-31 09:21:12,845 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 45 [2018-01-31 09:21:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:21:12,845 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2018-01-31 09:21:12,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:21:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2018-01-31 09:21:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:21:12,846 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:21:12,847 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:21:12,847 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 09:21:12,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1259505074, now seen corresponding path program 1 times [2018-01-31 09:21:12,849 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:21:12,849 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:21:12,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:12,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:12,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:21:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:12,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:21:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:21:13,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:21:13,297 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:21:13,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:21:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:21:13,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:21:13,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-01-31 09:21:13,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-31 09:21:13,352 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_1 term size 6 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-31 09:21:13,355 INFO L168 Benchmark]: Toolchain (without parser) took 90150.24 ms. Allocated memory was 306.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 265.6 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 791.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:21:13,356 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 306.7 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:21:13,356 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.36 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 255.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:21:13,356 INFO L168 Benchmark]: Boogie Preprocessor took 44.73 ms. Allocated memory is still 306.7 MB. Free memory was 255.6 MB in the beginning and 253.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:21:13,357 INFO L168 Benchmark]: RCFGBuilder took 667.49 ms. Allocated memory is still 306.7 MB. Free memory was 253.6 MB in the beginning and 230.7 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:21:13,357 INFO L168 Benchmark]: IcfgTransformer took 80694.89 ms. Allocated memory was 306.7 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 230.7 MB in the beginning and 654.2 MB in the end (delta: -423.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-31 09:21:13,357 INFO L168 Benchmark]: TraceAbstraction took 8412.44 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 104.3 MB). Free memory was 654.2 MB in the beginning and 1.4 GB in the end (delta: -788.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:21:13,359 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 306.7 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 319.36 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 255.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.73 ms. Allocated memory is still 306.7 MB. Free memory was 255.6 MB in the beginning and 253.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 667.49 ms. Allocated memory is still 306.7 MB. Free memory was 253.6 MB in the beginning and 230.7 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * IcfgTransformer took 80694.89 ms. Allocated memory was 306.7 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 230.7 MB in the beginning and 654.2 MB in the end (delta: -423.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * TraceAbstraction took 8412.44 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 104.3 MB). Free memory was 654.2 MB in the beginning and 1.4 GB in the end (delta: -788.0 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 80 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2480 LocStat_NO_SUPPORTING_DISEQUALITIES : 1289 LocStat_NO_DISJUNCTIONS : -160 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 105 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 167 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 113 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.116397 RENAME_VARIABLES(MILLISECONDS) : 0.267968 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.006078 PROJECTAWAY(MILLISECONDS) : 0.077489 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.062321 DISJOIN(MILLISECONDS) : 0.508881 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.288976 ADD_EQUALITY(MILLISECONDS) : 0.016378 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016728 #CONJOIN_DISJUNCTIVE : 1270 #RENAME_VARIABLES : 2851 #UNFREEZE : 0 #CONJOIN : 1822 #PROJECTAWAY : 1652 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 314 #RENAME_VARIABLES_DISJUNCTIVE : 2733 #ADD_EQUALITY : 169 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 2 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_1 term size 6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_1 term size 6: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_09-21-13-368.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_09-21-13-368.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_09-21-13-368.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_09-21-13-368.csv Received shutdown request...