java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:31:22,685 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:31:22,687 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:31:22,709 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:31:22,710 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:31:22,711 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:31:22,712 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:31:22,715 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:31:22,717 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:31:22,719 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:31:22,720 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:31:22,720 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:31:22,721 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:31:22,723 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:31:22,728 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:31:22,730 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:31:22,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:31:22,734 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:31:22,747 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:31:22,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:31:22,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:31:22,751 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:31:22,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:31:22,752 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:31:22,753 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:31:22,754 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:31:22,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:31:22,755 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:31:22,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:31:22,755 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:31:22,761 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:31:22,762 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:31:22,777 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:31:22,777 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:31:22,778 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:31:22,778 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:31:22,778 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:31:22,778 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:31:22,778 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:31:22,781 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:31:22,781 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:31:22,781 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:31:22,781 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:31:22,782 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:31:22,782 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:31:22,782 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:31:22,782 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:31:22,782 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:31:22,783 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:31:22,783 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:31:22,783 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:31:22,783 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:31:22,783 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:31:22,783 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:31:22,784 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:31:22,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:31:22,785 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:31:22,785 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:31:22,785 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:31:22,785 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:31:22,786 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:31:22,786 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:31:22,786 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:31:22,786 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:31:22,787 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:31:22,787 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:31:22,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:31:22,859 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:31:22,863 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:31:22,865 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:31:22,865 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:31:22,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-31 09:31:23,077 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:31:23,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:31:23,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:31:23,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:31:23,096 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:31:23,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:31:23" (1/1) ... [2018-01-31 09:31:23,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689907bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:31:23, skipping insertion in model container [2018-01-31 09:31:23,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:31:23" (1/1) ... [2018-01-31 09:31:23,121 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:31:23,181 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:31:23,362 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:31:23,388 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:31:23,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:31:23 WrapperNode [2018-01-31 09:31:23,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:31:23,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:31:23,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:31:23,399 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:31:23,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:31:23" (1/1) ... [2018-01-31 09:31:23,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:31:23" (1/1) ... [2018-01-31 09:31:23,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:31:23" (1/1) ... [2018-01-31 09:31:23,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:31:23" (1/1) ... [2018-01-31 09:31:23,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:31:23" (1/1) ... [2018-01-31 09:31:23,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:31:23" (1/1) ... [2018-01-31 09:31:23,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:31:23" (1/1) ... [2018-01-31 09:31:23,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:31:23,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:31:23,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:31:23,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:31:23,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:31:23" (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:31:23,528 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:31:23,529 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:31:23,529 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-31 09:31:23,529 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:31:23,529 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:31:23,529 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:31:23,530 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:31:23,530 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:31:23,530 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:31:23,530 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:31:23,530 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-31 09:31:23,530 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:31:23,531 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:31:23,531 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:31:24,131 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:31:24,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:31:24 BoogieIcfgContainer [2018-01-31 09:31:24,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:31:24,134 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:31:24,134 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:31:24,135 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:31:24,140 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:31:24" (1/1) ... [2018-01-31 09:31:24,151 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:31:24,151 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:31:24,152 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:31:24,222 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:31:24,269 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:31:24,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:32:43,426 INFO L314 AbstractInterpreter]: Visited 101 different actions 574 times. Merged at 64 different actions 259 times. Never widened. Found 26 fixpoints after 3 different actions. Largest state had 60 variables. [2018-01-31 09:32:43,430 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:32:43,448 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-31 09:32:43,448 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:32:43,449 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:32:43,449 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_7| v_cstrncmp_~s1.base_2) v_cstrncmp_~s1.offset_2), at (SUMMARY for call #t~mem2 := read~int(~s1.base, ~s1.offset, 1); srcloc: L546)) ((select (select |v_#memory_int_8| |v_cstrncmp_#t~post1.base_3|) |v_cstrncmp_#t~post1.offset_3|), at (SUMMARY for call #t~mem3 := read~int(#t~post1.base, #t~post1.offset, 1); srcloc: L546''')) ((select (select |v_#memory_int_11| |v_cstrncmp_#t~post7.base_3|) |v_cstrncmp_#t~post7.offset_3|), at (SUMMARY for call #t~mem8 := read~int(#t~post7.base, #t~post7.offset, 1); srcloc: L548'')) ((select |v_#memory_int_6| v_main_~nondetString2~4.base_2), at (SUMMARY for call write~int(0, ~nondetString2~4.base, ~nondetString2~4.offset + (~length2~4 - 1) * 1, 1); srcloc: L564')) ((select (select |v_#memory_int_9| v_cstrncmp_~s1.base_5) v_cstrncmp_~s1.offset_4), at (SUMMARY for call #t~mem5 := read~int(~s1.base, ~s1.offset, 1); srcloc: L547)) ((select |v_#memory_int_4| v_main_~nondetString1~4.base_2), at (SUMMARY for call write~int(0, ~nondetString1~4.base, ~nondetString1~4.offset + (~length1~4 - 1) * 1, 1); srcloc: L564)) ((select (select |v_#memory_int_10| |v_cstrncmp_#t~pre4.base_2|) |v_cstrncmp_#t~pre4.offset_2|), at (SUMMARY for call #t~mem6 := read~int(#t~pre4.base, #t~pre4.offset, 1); srcloc: L547''')) [2018-01-31 09:32:43,510 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:32:43,510 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:32:43,511 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:32:43,511 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-31 09:32:43,511 INFO L564 PartitionManager]: # location blocks :3 [2018-01-31 09:32:43,511 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:32:43,511 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-31 09:32:43,511 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:32:43,512 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:32:43,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:32:43 BasicIcfg [2018-01-31 09:32:43,532 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:32:43,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:32:43,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:32:43,615 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:32:43,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:31:23" (1/4) ... [2018-01-31 09:32:43,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c0d4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:32:43, skipping insertion in model container [2018-01-31 09:32:43,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:31:23" (2/4) ... [2018-01-31 09:32:43,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c0d4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:32:43, skipping insertion in model container [2018-01-31 09:32:43,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:31:24" (3/4) ... [2018-01-31 09:32:43,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c0d4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:32:43, skipping insertion in model container [2018-01-31 09:32:43,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:32:43" (4/4) ... [2018-01-31 09:32:43,619 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:32:43,628 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:32:43,634 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 09:32:43,680 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:32:43,680 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:32:43,680 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:32:43,680 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:32:43,680 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:32:43,681 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:32:43,681 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:32:43,681 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:32:43,682 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:32:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-31 09:32:43,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:32:43,706 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:43,706 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:32:43,706 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:43,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1050940434, now seen corresponding path program 1 times [2018-01-31 09:32:43,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:43,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:43,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:43,754 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:43,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:43,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:43,936 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:32:43,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:32:43,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:32:43,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:32:43,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:32:43,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:32:43,948 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 4 states. [2018-01-31 09:32:44,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:44,205 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2018-01-31 09:32:44,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:32:44,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-31 09:32:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:44,219 INFO L225 Difference]: With dead ends: 108 [2018-01-31 09:32:44,219 INFO L226 Difference]: Without dead ends: 88 [2018-01-31 09:32:44,223 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:32:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-31 09:32:44,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-31 09:32:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 09:32:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-01-31 09:32:44,264 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 15 [2018-01-31 09:32:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:44,265 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-01-31 09:32:44,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:32:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-01-31 09:32:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:32:44,266 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:44,266 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:32:44,266 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:44,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1050940432, now seen corresponding path program 1 times [2018-01-31 09:32:44,267 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:44,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:44,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:44,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:44,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:44,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:44,553 WARN L143 SmtUtils]: Spent 123ms on a formula simplification that was a NOOP. DAG size: 14 [2018-01-31 09:32:44,635 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:32:44,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:32:44,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:32:44,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:32:44,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:32:44,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:32:44,638 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 6 states. [2018-01-31 09:32:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:44,840 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-01-31 09:32:44,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:32:44,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-31 09:32:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:44,844 INFO L225 Difference]: With dead ends: 88 [2018-01-31 09:32:44,844 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 09:32:44,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:32:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 09:32:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-31 09:32:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 09:32:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-31 09:32:44,856 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 15 [2018-01-31 09:32:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:44,856 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-31 09:32:44,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:32:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-31 09:32:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:32:44,857 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:44,858 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:32:44,858 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:44,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1780585313, now seen corresponding path program 1 times [2018-01-31 09:32:44,858 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:44,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:44,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:44,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:44,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:44,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:44,915 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:32:44,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:32:44,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:32:44,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:32:44,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:32:44,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:32:44,916 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 4 states. [2018-01-31 09:32:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:45,000 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-31 09:32:45,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:32:45,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-31 09:32:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:45,002 INFO L225 Difference]: With dead ends: 87 [2018-01-31 09:32:45,003 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 09:32:45,003 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:32:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 09:32:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-31 09:32:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 09:32:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-01-31 09:32:45,011 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 16 [2018-01-31 09:32:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:45,011 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-01-31 09:32:45,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:32:45,012 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-01-31 09:32:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:32:45,012 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:45,012 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:32:45,013 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:45,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1780585315, now seen corresponding path program 1 times [2018-01-31 09:32:45,013 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:45,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:45,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:45,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:45,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:45,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:45,297 WARN L143 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 09:32:45,630 WARN L146 SmtUtils]: Spent 257ms on a formula simplification. DAG size of input: 15 DAG size of output 11 [2018-01-31 09:32:45,631 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:32:45,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:32:45,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:32:45,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:32:45,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:32:45,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:32:45,633 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 5 states. [2018-01-31 09:32:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:46,034 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-01-31 09:32:46,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:32:46,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-31 09:32:46,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:46,035 INFO L225 Difference]: With dead ends: 86 [2018-01-31 09:32:46,035 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 09:32:46,035 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:32:46,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 09:32:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-31 09:32:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 09:32:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-31 09:32:46,041 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2018-01-31 09:32:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:46,042 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-31 09:32:46,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:32:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-31 09:32:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 09:32:46,043 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:46,043 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] [2018-01-31 09:32:46,043 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:46,043 INFO L82 PathProgramCache]: Analyzing trace with hash -430381833, now seen corresponding path program 1 times [2018-01-31 09:32:46,043 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:46,044 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:46,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:46,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:46,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:46,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:46,188 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:32:46,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:32:46,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:32:46,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:32:46,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:32:46,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:32:46,189 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 5 states. [2018-01-31 09:32:46,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:46,293 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-01-31 09:32:46,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:32:46,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-31 09:32:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:46,296 INFO L225 Difference]: With dead ends: 91 [2018-01-31 09:32:46,296 INFO L226 Difference]: Without dead ends: 89 [2018-01-31 09:32:46,297 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:32:46,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-31 09:32:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-01-31 09:32:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 09:32:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-01-31 09:32:46,305 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 24 [2018-01-31 09:32:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:46,306 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-01-31 09:32:46,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:32:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-01-31 09:32:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 09:32:46,307 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:46,307 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] [2018-01-31 09:32:46,307 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash -430381831, now seen corresponding path program 1 times [2018-01-31 09:32:46,307 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:46,308 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:46,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:46,309 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:46,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:46,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:46,499 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:32:46,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:32:46,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:32:46,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:32:46,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:32:46,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:32:46,501 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 8 states. [2018-01-31 09:32:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:46,775 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-01-31 09:32:46,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:32:46,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-01-31 09:32:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:46,776 INFO L225 Difference]: With dead ends: 114 [2018-01-31 09:32:46,777 INFO L226 Difference]: Without dead ends: 112 [2018-01-31 09:32:46,777 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:32:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-31 09:32:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2018-01-31 09:32:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-31 09:32:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-01-31 09:32:46,785 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 24 [2018-01-31 09:32:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:46,786 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-01-31 09:32:46,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:32:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-01-31 09:32:46,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 09:32:46,787 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:46,787 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:32:46,787 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:46,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1027360366, now seen corresponding path program 1 times [2018-01-31 09:32:46,787 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:46,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:46,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:46,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:46,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:46,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:46,880 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:32:46,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:32:46,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:32:46,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:32:46,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:32:46,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:32:46,881 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 6 states. [2018-01-31 09:32:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:47,007 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-01-31 09:32:47,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:32:47,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-31 09:32:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:47,009 INFO L225 Difference]: With dead ends: 94 [2018-01-31 09:32:47,009 INFO L226 Difference]: Without dead ends: 93 [2018-01-31 09:32:47,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:32:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-31 09:32:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-31 09:32:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-31 09:32:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-01-31 09:32:47,015 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 27 [2018-01-31 09:32:47,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:47,016 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-01-31 09:32:47,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:32:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-01-31 09:32:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 09:32:47,018 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:47,018 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:32:47,018 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:47,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1027360364, now seen corresponding path program 1 times [2018-01-31 09:32:47,018 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:47,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:47,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:47,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:47,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:47,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:47,145 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:32:47,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:32:47,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:32:47,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:32:47,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:32:47,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:32:47,147 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 9 states. [2018-01-31 09:32:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:47,467 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-01-31 09:32:47,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:32:47,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-01-31 09:32:47,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:47,468 INFO L225 Difference]: With dead ends: 98 [2018-01-31 09:32:47,468 INFO L226 Difference]: Without dead ends: 97 [2018-01-31 09:32:47,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:32:47,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-31 09:32:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-01-31 09:32:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-31 09:32:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-01-31 09:32:47,476 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 27 [2018-01-31 09:32:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:47,476 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-01-31 09:32:47,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:32:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-01-31 09:32:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 09:32:47,478 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:47,478 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:32:47,478 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:47,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1896582994, now seen corresponding path program 1 times [2018-01-31 09:32:47,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:47,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:47,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:47,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:47,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:47,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:32:47,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:32:47,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:32:47,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:32:47,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:32:47,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:32:47,661 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 6 states. [2018-01-31 09:32:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:47,938 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-01-31 09:32:47,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:32:47,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-31 09:32:47,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:47,940 INFO L225 Difference]: With dead ends: 93 [2018-01-31 09:32:47,940 INFO L226 Difference]: Without dead ends: 72 [2018-01-31 09:32:47,941 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:32:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-31 09:32:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-31 09:32:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-31 09:32:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-01-31 09:32:47,947 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 27 [2018-01-31 09:32:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:47,947 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-01-31 09:32:47,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:32:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-01-31 09:32:47,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:32:47,948 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:47,949 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:32:47,949 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:47,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1338533173, now seen corresponding path program 1 times [2018-01-31 09:32:47,949 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:47,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:47,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:47,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:47,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:47,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:48,072 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:32:48,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:32:48,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:32:48,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:32:48,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:32:48,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:32:48,074 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 8 states. [2018-01-31 09:32:48,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:48,185 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-01-31 09:32:48,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:32:48,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-31 09:32:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:48,186 INFO L225 Difference]: With dead ends: 87 [2018-01-31 09:32:48,186 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 09:32:48,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:32:48,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 09:32:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2018-01-31 09:32:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 09:32:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-31 09:32:48,190 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 34 [2018-01-31 09:32:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:48,190 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-31 09:32:48,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:32:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-31 09:32:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:32:48,191 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:48,191 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:32:48,192 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:48,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1338533171, now seen corresponding path program 1 times [2018-01-31 09:32:48,192 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:48,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:48,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:48,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:48,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:48,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:48,367 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:32:48,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:32:48,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:32:48,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:32:48,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:32:48,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:32:48,368 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 6 states. [2018-01-31 09:32:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:48,446 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-31 09:32:48,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:32:48,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-31 09:32:48,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:48,447 INFO L225 Difference]: With dead ends: 78 [2018-01-31 09:32:48,447 INFO L226 Difference]: Without dead ends: 76 [2018-01-31 09:32:48,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:32:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-31 09:32:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-31 09:32:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 09:32:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-31 09:32:48,452 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 34 [2018-01-31 09:32:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:48,452 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-31 09:32:48,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:32:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-31 09:32:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 09:32:48,453 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:48,454 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:32:48,454 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:48,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1814876330, now seen corresponding path program 1 times [2018-01-31 09:32:48,454 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:48,454 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:48,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:48,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:48,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:48,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:48,525 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:32:48,525 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:32:48,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:32:48,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:32:48,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:32:48,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:32:48,526 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 5 states. [2018-01-31 09:32:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:48,571 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-01-31 09:32:48,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:32:48,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-31 09:32:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:48,572 INFO L225 Difference]: With dead ends: 76 [2018-01-31 09:32:48,572 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 09:32:48,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:32:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 09:32:48,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-31 09:32:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 09:32:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-31 09:32:48,577 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 35 [2018-01-31 09:32:48,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:48,578 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-31 09:32:48,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:32:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-31 09:32:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 09:32:48,579 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:48,579 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:32:48,579 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:48,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1814876332, now seen corresponding path program 1 times [2018-01-31 09:32:48,580 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:48,580 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:48,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:48,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:48,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:48,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:48,784 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:32:48,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:32:48,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 09:32:48,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:32:48,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:32:48,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:32:48,785 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 12 states. [2018-01-31 09:32:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:49,370 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-01-31 09:32:49,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:32:49,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-01-31 09:32:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:49,370 INFO L225 Difference]: With dead ends: 91 [2018-01-31 09:32:49,370 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 09:32:49,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:32:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 09:32:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2018-01-31 09:32:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-31 09:32:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-01-31 09:32:49,374 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 35 [2018-01-31 09:32:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:49,374 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-01-31 09:32:49,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:32:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-01-31 09:32:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 09:32:49,375 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:49,375 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, 1, 1] [2018-01-31 09:32:49,376 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash 128910148, now seen corresponding path program 1 times [2018-01-31 09:32:49,376 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:49,376 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:49,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:49,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:49,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:49,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:49,731 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:32:49,731 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:32:49,731 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:32:49,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:49,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:32:49,850 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:32:49,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:32:49,857 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:32:49,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-01-31 09:32:49,911 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:32:49,925 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:32:49,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:32:49,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:32:50,045 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:32:50,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-31 09:32:50,818 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 20 treesize of output 16 [2018-01-31 09:32:50,827 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 16 treesize of output 13 [2018-01-31 09:32:50,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:32:50,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:32:50,844 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:32:50,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-31 09:32:50,955 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:32:50,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:32:50,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-01-31 09:32:50,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 09:32:50,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 09:32:50,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=297, Unknown=3, NotChecked=0, Total=342 [2018-01-31 09:32:50,977 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 19 states. [2018-01-31 09:32:51,298 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 27 DAG size of output 22 [2018-01-31 09:32:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:32:52,178 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-01-31 09:32:52,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:32:52,178 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-01-31 09:32:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:32:52,179 INFO L225 Difference]: With dead ends: 100 [2018-01-31 09:32:52,179 INFO L226 Difference]: Without dead ends: 98 [2018-01-31 09:32:52,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=121, Invalid=632, Unknown=3, NotChecked=0, Total=756 [2018-01-31 09:32:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-31 09:32:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2018-01-31 09:32:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 09:32:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-31 09:32:52,185 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 43 [2018-01-31 09:32:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:32:52,185 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-31 09:32:52,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 09:32:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-31 09:32:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 09:32:52,186 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:32:52,187 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:32:52,187 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:32:52,188 INFO L82 PathProgramCache]: Analyzing trace with hash 661844841, now seen corresponding path program 1 times [2018-01-31 09:32:52,188 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:32:52,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:32:52,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:52,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:52,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:32:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:52,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:32:52,747 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 19 DAG size of output 11 [2018-01-31 09:32:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:32:53,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:32:53,000 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:32:53,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:32:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:32:53,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:32:53,071 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:32:53,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:32:53,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 09:32:53,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:17 [2018-01-31 09:32:53,195 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:32:53,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:32:53,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2018-01-31 09:32:53,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 23 treesize of output 21 [2018-01-31 09:32:53,292 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 09:32:53,306 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:32:53,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-31 09:32:53,313 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:38, output treesize:31 [2018-01-31 09:32:53,725 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 20 treesize of output 16 [2018-01-31 09:32:53,732 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 16 treesize of output 13 [2018-01-31 09:32:53,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:32:53,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:32:53,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-31 09:32:53,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:63 [2018-01-31 09:32:55,539 WARN L143 SmtUtils]: Spent 1545ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-31 09:32:57,628 WARN L143 SmtUtils]: Spent 2033ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-31 09:32:57,636 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 33 treesize of output 27 [2018-01-31 09:32:57,674 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 0 case distinctions, treesize of input 19 treesize of output 3 [2018-01-31 09:32:57,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:32:57,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:32:57,707 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 28 treesize of output 24 [2018-01-31 09:32:57,755 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:32:57,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-31 09:32:57,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:32:57,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:32:57,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:62, output treesize:24 [2018-01-31 09:32:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:32:57,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:32:57,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2018-01-31 09:32:57,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 09:32:57,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 09:32:57,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=739, Unknown=3, NotChecked=0, Total=812 [2018-01-31 09:32:57,847 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 29 states. [2018-01-31 09:32:59,197 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 88 DAG size of output 62 [2018-01-31 09:33:00,722 WARN L146 SmtUtils]: Spent 1216ms on a formula simplification. DAG size of input: 74 DAG size of output 64 [2018-01-31 09:33:02,858 WARN L146 SmtUtils]: Spent 2099ms on a formula simplification. DAG size of input: 65 DAG size of output 60 [2018-01-31 09:33:04,216 WARN L146 SmtUtils]: Spent 1323ms on a formula simplification. DAG size of input: 70 DAG size of output 63 [2018-01-31 09:33:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:05,120 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2018-01-31 09:33:05,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 09:33:05,120 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 46 [2018-01-31 09:33:05,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:05,121 INFO L225 Difference]: With dead ends: 98 [2018-01-31 09:33:05,121 INFO L226 Difference]: Without dead ends: 97 [2018-01-31 09:33:05,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=304, Invalid=2043, Unknown=5, NotChecked=0, Total=2352 [2018-01-31 09:33:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-31 09:33:05,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2018-01-31 09:33:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 09:33:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-01-31 09:33:05,132 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 46 [2018-01-31 09:33:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:05,132 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-01-31 09:33:05,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 09:33:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-01-31 09:33:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-31 09:33:05,133 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:05,133 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:05,133 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:33:05,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1450090048, now seen corresponding path program 1 times [2018-01-31 09:33:05,134 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:05,134 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:05,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:05,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:05,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:05,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:33:05,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:33:05,706 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:33:05,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:05,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:33:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:33:05,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:33:05,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2018-01-31 09:33:05,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:33:05,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:33:05,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:33:05,778 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 12 states. [2018-01-31 09:33:05,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:05,990 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-01-31 09:33:05,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:33:05,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-01-31 09:33:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:05,991 INFO L225 Difference]: With dead ends: 88 [2018-01-31 09:33:05,991 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 09:33:05,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-01-31 09:33:05,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 09:33:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2018-01-31 09:33:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-31 09:33:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-01-31 09:33:05,996 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 53 [2018-01-31 09:33:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:05,997 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-01-31 09:33:05,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:33:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-01-31 09:33:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 09:33:05,997 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:05,997 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:05,997 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:33:05,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1266902401, now seen corresponding path program 1 times [2018-01-31 09:33:05,998 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:05,998 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:05,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:05,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:05,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:06,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:33:06,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:33:06,233 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:33:06,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:06,267 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:33:06,410 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:33:06,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:33:06,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 15 [2018-01-31 09:33:06,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 09:33:06,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 09:33:06,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:33:06,431 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 16 states. [2018-01-31 09:33:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:06,773 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-01-31 09:33:06,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 09:33:06,773 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-01-31 09:33:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:06,774 INFO L225 Difference]: With dead ends: 81 [2018-01-31 09:33:06,774 INFO L226 Difference]: Without dead ends: 73 [2018-01-31 09:33:06,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-01-31 09:33:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-31 09:33:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-31 09:33:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-31 09:33:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-01-31 09:33:06,780 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 54 [2018-01-31 09:33:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:06,780 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-01-31 09:33:06,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 09:33:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-01-31 09:33:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 09:33:06,781 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:06,781 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:06,781 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:33:06,782 INFO L82 PathProgramCache]: Analyzing trace with hash 505541401, now seen corresponding path program 2 times [2018-01-31 09:33:06,782 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:06,782 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:06,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:06,783 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:33:06,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:06,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:07,056 WARN L143 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 13 [2018-01-31 09:33:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:33:07,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:33:07,373 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:33:07,378 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:33:07,395 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:33:07,425 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:33:07,438 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:33:07,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:33:07,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:33:07,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:33:07,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:33:07,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:33:07,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:33:07,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 09:33:07,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:33:07,866 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:33:07,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 09:33:07,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:33:07,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-31 09:33:07,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:33:07,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:33:07,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-31 09:33:08,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-31 09:33:08,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:33:08,047 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:33:08,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2018-01-31 09:33:08,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-31 09:33:08,234 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 13 treesize of output 12 [2018-01-31 09:33:08,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:33:08,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:33:08,241 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:33:08,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:19 [2018-01-31 09:33:08,724 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 22 treesize of output 18 [2018-01-31 09:33:08,792 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 18 treesize of output 15 [2018-01-31 09:33:08,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:33:08,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:33:08,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:33:08,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-31 09:33:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:33:08,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:33:08,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2018-01-31 09:33:08,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-31 09:33:08,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-31 09:33:08,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=905, Unknown=1, NotChecked=0, Total=992 [2018-01-31 09:33:08,941 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 32 states. [2018-01-31 09:33:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:33:10,239 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-01-31 09:33:10,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 09:33:10,240 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-01-31 09:33:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:33:10,240 INFO L225 Difference]: With dead ends: 79 [2018-01-31 09:33:10,240 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 09:33:10,241 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=294, Invalid=2057, Unknown=1, NotChecked=0, Total=2352 [2018-01-31 09:33:10,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 09:33:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2018-01-31 09:33:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-31 09:33:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-01-31 09:33:10,249 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 62 [2018-01-31 09:33:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:33:10,249 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-01-31 09:33:10,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-31 09:33:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-01-31 09:33:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-31 09:33:10,250 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:33:10,250 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:33:10,250 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-31 09:33:10,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1866041484, now seen corresponding path program 2 times [2018-01-31 09:33:10,251 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:33:10,251 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:33:10,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:10,252 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:33:10,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:33:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:33:10,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:33:10,879 WARN L146 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 18 DAG size of output 13 [2018-01-31 09:33:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:33:11,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:33:11,248 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:33:11,253 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:33:11,266 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:33:11,274 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:33:11,277 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:33:11,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:33:11,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:33:11,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:33:11,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:33:11,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:33:11,334 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 16 treesize of output 14 [2018-01-31 09:33:11,335 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 14 treesize of output 17 [2018-01-31 09:33:11,337 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:33:11,340 INFO L168 Benchmark]: Toolchain (without parser) took 108262.24 ms. Allocated memory was 305.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 265.5 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 524.2 MB. Max. memory is 5.3 GB. [2018-01-31 09:33:11,341 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:33:11,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.22 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.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:33:11,341 INFO L168 Benchmark]: Boogie Preprocessor took 49.57 ms. Allocated memory is still 305.7 MB. Free memory was 254.6 MB in the beginning and 252.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:33:11,341 INFO L168 Benchmark]: RCFGBuilder took 683.65 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 229.5 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:33:11,341 INFO L168 Benchmark]: IcfgTransformer took 79397.64 ms. Allocated memory was 305.7 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 229.5 MB in the beginning and 891.2 MB in the end (delta: -661.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-31 09:33:11,342 INFO L168 Benchmark]: TraceAbstraction took 27806.64 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 100.1 MB). Free memory was 891.2 MB in the beginning and 1.7 GB in the end (delta: -811.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:33:11,344 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.20 ms. Allocated memory is still 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 311.22 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.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 49.57 ms. Allocated memory is still 305.7 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 683.65 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 229.5 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 79397.64 ms. Allocated memory was 305.7 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 229.5 MB in the beginning and 891.2 MB in the end (delta: -661.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. * TraceAbstraction took 27806.64 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 100.1 MB). Free memory was 891.2 MB in the beginning and 1.7 GB in the end (delta: -811.5 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 : 84 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2608 LocStat_NO_SUPPORTING_DISEQUALITIES : 1402 LocStat_NO_DISJUNCTIONS : -168 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 110 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 167 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 116 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.395720 RENAME_VARIABLES(MILLISECONDS) : 0.008400 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.500981 PROJECTAWAY(MILLISECONDS) : 1.052889 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.056999 DISJOIN(MILLISECONDS) : 0.459346 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.017329 ADD_EQUALITY(MILLISECONDS) : 0.020520 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011352 #CONJOIN_DISJUNCTIVE : 908 #RENAME_VARIABLES : 2025 #UNFREEZE : 0 #CONJOIN : 1342 #PROJECTAWAY : 1233 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 357 #RENAME_VARIABLES_DISJUNCTIVE : 1963 #ADD_EQUALITY : 169 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 14 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 2 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_1 term size 6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_1 term size 6: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_09-33-11-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_09-33-11-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_09-33-11-353.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_09-33-11-353.csv Received shutdown request...