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/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:29:42,858 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:29:42,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:29:42,873 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:29:42,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:29:42,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:29:42,875 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:29:42,877 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:29:42,880 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:29:42,880 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:29:42,881 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:29:42,882 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:29:42,883 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:29:42,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:29:42,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:29:42,887 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:29:42,890 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:29:42,892 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:29:42,893 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:29:42,894 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:29:42,897 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:29:42,897 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:29:42,897 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:29:42,898 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:29:42,899 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:29:42,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:29:42,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:29:42,901 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:29:42,902 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:29:42,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:29:42,903 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:29:42,903 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:29:42,913 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:29:42,914 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:29:42,914 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:29:42,915 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:29:42,915 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:29:42,915 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:29:42,915 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:29:42,915 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:29:42,916 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:29:42,917 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:29:42,917 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:29:42,917 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:29:42,917 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:29:42,917 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:29:42,918 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:29:42,918 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:29:42,918 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:29:42,918 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:29:42,918 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:29:42,918 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:29:42,919 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:29:42,919 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:29:42,919 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:29:42,919 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:29:42,919 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:29:42,920 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:29:42,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:29:42,920 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:29:42,920 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:29:42,921 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:29:42,921 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:29:42,921 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:29:42,921 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:29:42,921 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:29:42,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:29:42,922 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:29:42,922 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:29:42,923 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:29:42,923 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:29:42,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:29:42,971 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:29:42,975 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:29:42,977 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:29:42,977 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:29:42,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:29:43,124 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:29:43,129 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:29:43,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:29:43,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:29:43,134 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:29:43,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:29:43" (1/1) ... [2018-01-21 00:29:43,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3072b9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:43, skipping insertion in model container [2018-01-21 00:29:43,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:29:43" (1/1) ... [2018-01-21 00:29:43,149 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:29:43,188 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:29:43,302 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:29:43,317 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:29:43,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:43 WrapperNode [2018-01-21 00:29:43,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:29:43,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:29:43,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:29:43,326 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:29:43,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:43" (1/1) ... [2018-01-21 00:29:43,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:43" (1/1) ... [2018-01-21 00:29:43,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:43" (1/1) ... [2018-01-21 00:29:43,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:43" (1/1) ... [2018-01-21 00:29:43,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:43" (1/1) ... [2018-01-21 00:29:43,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:43" (1/1) ... [2018-01-21 00:29:43,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:43" (1/1) ... [2018-01-21 00:29:43,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:29:43,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:29:43,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:29:43,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:29:43,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:43" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:29:43,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:29:43,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:29:43,422 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-21 00:29:43,422 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:29:43,423 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:29:43,423 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:29:43,423 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:29:43,423 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:29:43,423 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:29:43,423 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:29:43,423 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-21 00:29:43,424 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:29:43,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:29:43,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:29:43,655 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:29:43,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:29:43 BoogieIcfgContainer [2018-01-21 00:29:43,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:29:43,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:29:43,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:29:43,658 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:29:43,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:29:43" (1/3) ... [2018-01-21 00:29:43,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0191fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:29:43, skipping insertion in model container [2018-01-21 00:29:43,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:43" (2/3) ... [2018-01-21 00:29:43,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0191fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:29:43, skipping insertion in model container [2018-01-21 00:29:43,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:29:43" (3/3) ... [2018-01-21 00:29:43,663 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:29:43,670 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:29:43,675 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:29:43,723 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:43,723 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:43,723 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:43,723 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:43,723 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:43,724 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:43,724 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:43,724 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:29:43,725 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 00:29:43,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:29:43,753 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:43,754 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:29:43,754 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:29:43,759 INFO L82 PathProgramCache]: Analyzing trace with hash 98985, now seen corresponding path program 1 times [2018-01-21 00:29:43,762 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:43,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:43,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:43,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:43,807 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:43,861 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:29:43,867 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:43,872 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:43,872 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:43,872 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:43,872 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:43,873 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:43,873 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:43,873 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:43,873 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == cstrcmpErr0EnsuresViolation======== [2018-01-21 00:29:43,873 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 00:29:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 00:29:43,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:43,876 INFO L322 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-21 00:29:43,876 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0EnsuresViolation]=== [2018-01-21 00:29:43,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1621624204, now seen corresponding path program 1 times [2018-01-21 00:29:43,876 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:43,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:43,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:43,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:43,878 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:43,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:43,961 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-21 00:29:43,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:43,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:43,964 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:43,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:43,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:43,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:43,984 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-21 00:29:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:44,087 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-01-21 00:29:44,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:44,088 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-21 00:29:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:44,096 INFO L225 Difference]: With dead ends: 64 [2018-01-21 00:29:44,096 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:29:44,100 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:29:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:29:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:29:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:29:44,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-21 00:29:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:44,125 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:29:44,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:29:44,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:29:44,127 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:44,127 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:44,128 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:44,128 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:44,128 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:44,128 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:44,128 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:44,128 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:29:44,128 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:44,129 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 00:29:44,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 00:29:44,131 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:44,131 INFO L322 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] [2018-01-21 00:29:44,131 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:44,131 INFO L82 PathProgramCache]: Analyzing trace with hash 29258502, now seen corresponding path program 1 times [2018-01-21 00:29:44,131 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:44,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:44,132 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:44,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:44,132 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:44,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:44,177 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-21 00:29:44,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:44,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:44,177 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:44,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:44,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:44,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:44,178 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-21 00:29:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:44,184 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-01-21 00:29:44,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:44,184 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-01-21 00:29:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:44,189 INFO L225 Difference]: With dead ends: 64 [2018-01-21 00:29:44,189 INFO L226 Difference]: Without dead ends: 41 [2018-01-21 00:29:44,189 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-21 00:29:44,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-21 00:29:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 00:29:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-21 00:29:44,203 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 33 [2018-01-21 00:29:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:44,203 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-21 00:29:44,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-21 00:29:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:29:44,205 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:44,205 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:44,205 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:44,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1608365208, now seen corresponding path program 1 times [2018-01-21 00:29:44,206 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:44,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:44,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:44,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:44,208 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:44,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:44,558 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-21 00:29:44,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:44,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-21 00:29:44,559 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:44,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-21 00:29:44,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-21 00:29:44,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-21 00:29:44,561 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 10 states. [2018-01-21 00:29:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:45,026 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-01-21 00:29:45,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 00:29:45,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-21 00:29:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:45,032 INFO L225 Difference]: With dead ends: 83 [2018-01-21 00:29:45,033 INFO L226 Difference]: Without dead ends: 74 [2018-01-21 00:29:45,034 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-21 00:29:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-21 00:29:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2018-01-21 00:29:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-21 00:29:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-01-21 00:29:45,054 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 37 [2018-01-21 00:29:45,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:45,054 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-01-21 00:29:45,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-21 00:29:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-01-21 00:29:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:29:45,057 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:45,058 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:45,058 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1866530646, now seen corresponding path program 1 times [2018-01-21 00:29:45,058 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:45,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:45,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:45,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:45,060 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:45,118 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:29:45,127 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:45,132 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:45,135 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:45,135 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:45,151 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:45,151 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:45,151 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:45,151 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:45,152 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:45,152 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:45,152 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:45,152 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:29:45,152 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 00:29:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 00:29:45,155 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:45,155 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:45,155 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:45,155 INFO L82 PathProgramCache]: Analyzing trace with hash 996677382, now seen corresponding path program 1 times [2018-01-21 00:29:45,156 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:45,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:45,157 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:45,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:45,157 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:45,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:45,184 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-21 00:29:45,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:45,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:45,184 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:45,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:45,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:45,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:45,186 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-21 00:29:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:45,190 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-01-21 00:29:45,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:45,190 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-01-21 00:29:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:45,191 INFO L225 Difference]: With dead ends: 64 [2018-01-21 00:29:45,191 INFO L226 Difference]: Without dead ends: 39 [2018-01-21 00:29:45,191 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-21 00:29:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-21 00:29:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-21 00:29:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-01-21 00:29:45,195 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 31 [2018-01-21 00:29:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:45,195 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-01-21 00:29:45,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-01-21 00:29:45,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 00:29:45,196 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:45,196 INFO L322 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-21 00:29:45,196 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:45,197 INFO L82 PathProgramCache]: Analyzing trace with hash -248605416, now seen corresponding path program 1 times [2018-01-21 00:29:45,197 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:45,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:45,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:45,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:45,198 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:45,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:45,511 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-21 00:29:45,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:45,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:29:45,511 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:45,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-21 00:29:45,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-21 00:29:45,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-21 00:29:45,512 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-01-21 00:29:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:45,763 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-01-21 00:29:45,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 00:29:45,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-21 00:29:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:45,764 INFO L225 Difference]: With dead ends: 39 [2018-01-21 00:29:45,764 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:29:45,765 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-21 00:29:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:29:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:29:45,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:29:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:29:45,766 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-21 00:29:45,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:45,767 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:29:45,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-21 00:29:45,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:29:45,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:29:45,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:29:45 BoogieIcfgContainer [2018-01-21 00:29:45,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:29:45,771 INFO L168 Benchmark]: Toolchain (without parser) took 2646.38 ms. Allocated memory was 308.3 MB in the beginning and 480.8 MB in the end (delta: 172.5 MB). Free memory was 267.2 MB in the beginning and 429.5 MB in the end (delta: -162.3 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:45,773 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 308.3 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:29:45,773 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.39 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:45,773 INFO L168 Benchmark]: Boogie Preprocessor took 38.12 ms. Allocated memory is still 308.3 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:45,774 INFO L168 Benchmark]: RCFGBuilder took 291.78 ms. Allocated memory is still 308.3 MB. Free memory was 255.2 MB in the beginning and 238.3 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:45,774 INFO L168 Benchmark]: TraceAbstraction took 2114.08 ms. Allocated memory was 308.3 MB in the beginning and 480.8 MB in the end (delta: 172.5 MB). Free memory was 238.3 MB in the beginning and 429.5 MB in the end (delta: -191.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:29:45,776 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 308.3 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 195.39 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.12 ms. Allocated memory is still 308.3 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 291.78 ms. Allocated memory is still 308.3 MB. Free memory was 255.2 MB in the beginning and 238.3 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2114.08 ms. Allocated memory was 308.3 MB in the beginning and 480.8 MB in the end (delta: 172.5 MB). Free memory was 238.3 MB in the beginning and 429.5 MB in the end (delta: -191.2 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 45 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: cstrcmpErr0EnsuresViolation CFG has 4 procedures, 45 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L552] int length1 = __VERIFIER_nondet_int(); [L553] int length2 = __VERIFIER_nondet_int(); [L554] COND TRUE length1 < 1 [L555] length1 = 1 VAL [length1=1, length2=0] [L557] COND TRUE length2 < 1 [L558] length2 = 1 VAL [length1=1, length2=1] [L560] EXPR, FCALL __builtin_alloca (length1 * sizeof(char)) VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, length1=1, length2=1] [L560] char* nondetString1 = (char*) __builtin_alloca (length1 * sizeof(char)); VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, length1=1, length2=1, nondetString1={3:0}] [L561] EXPR, FCALL __builtin_alloca (length2 * sizeof(char)) VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, __builtin_alloca (length2 * sizeof(char))={4:0}, length1=1, length2=1, nondetString1={3:0}] [L561] char* nondetString2 = (char*) __builtin_alloca (length2 * sizeof(char)); VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, __builtin_alloca (length2 * sizeof(char))={4:0}, length1=1, length2=1, nondetString1={3:0}, nondetString2={4:0}] [L562] FCALL nondetString1[length1-1] = '\0' VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, __builtin_alloca (length2 * sizeof(char))={4:0}, length1=1, length2=1, nondetString1={3:0}, nondetString2={4:0}] [L563] FCALL nondetString2[length2-1] = '\0' VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, __builtin_alloca (length2 * sizeof(char))={4:0}, length1=1, length2=1, nondetString1={3:0}, nondetString2={4:0}] [L564] CALL, EXPR cstrcmp(nondetString1,nondetString2) VAL [s1={3:0}, s2={4:0}] [L542] unsigned char uc1, uc2; VAL [s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}] [L543] EXPR, FCALL \read(*s1) VAL [\read(*s1)=0, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}] [L543] *s1 != '\0' && *s1 == *s2 VAL [*s1 != '\0' && *s1 == *s2=0, \read(*s1)=0, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}] [L543] COND FALSE !(*s1 != '\0' && *s1 == *s2) [L547] EXPR, FCALL \read(*s1) VAL [\read(*s1)=0, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}] [L547] uc1 = (*(unsigned char *) s1) [L548] EXPR, FCALL \read(*s2) VAL [\read(*s2)=0, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}, uc1=0] [L548] uc2 = (*(unsigned char *) s2) [L549] COND FALSE, EXPR !((uc1 < uc2) ? -1 : (uc1 > uc2)) VAL [(uc1 < uc2) ? -1 : (uc1 > uc2)=0, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}, uc1=0, uc2=0] [L549] RET return ((uc1 < uc2) ? -1 : (uc1 > uc2)); [L564] EXPR cstrcmp(nondetString1,nondetString2) VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, __builtin_alloca (length2 * sizeof(char))={4:0}, cstrcmp(nondetString1,nondetString2)=0, length1=1, length2=1, nondetString1={3:0}, nondetString2={4:0}] [L564] return cstrcmp(nondetString1,nondetString2); - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 45 locations, 4 error locations. UNSAFE Result, 1.0s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 90 SDtfs, 47 SDslu, 218 SDs, 0 SdLazy, 104 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 7000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 551]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 45 locations, 4 error locations. SAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 27 SDslu, 30 SDs, 0 SdLazy, 178 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 7938 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-29-45-785.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-29-45-785.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-29-45-785.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-29-45-785.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-29-45-785.csv Received shutdown request...