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/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:30:08,209 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:30:08,211 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:30:08,227 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:30:08,227 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:30:08,228 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:30:08,229 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:30:08,230 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:30:08,232 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:30:08,232 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:30:08,233 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:30:08,233 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:30:08,234 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:30:08,236 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:30:08,237 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:30:08,240 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:30:08,243 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:30:08,245 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:30:08,246 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:30:08,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:30:08,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:30:08,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:30:08,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:30:08,252 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:30:08,253 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:30:08,255 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:30:08,255 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:30:08,256 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:30:08,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:30:08,256 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:30:08,257 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:30:08,257 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:30:08,267 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:30:08,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:30:08,268 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:30:08,269 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:30:08,269 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:30:08,269 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:30:08,269 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:30:08,269 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:30:08,270 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:30:08,270 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:30:08,271 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:30:08,271 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:30:08,271 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:30:08,271 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:30:08,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:30:08,272 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:30:08,272 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:30:08,272 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:30:08,272 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:30:08,272 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:30:08,273 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:30:08,273 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:30:08,273 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:30:08,273 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:30:08,273 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:30:08,273 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:30:08,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:30:08,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:30:08,274 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:30:08,274 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:30:08,274 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:30:08,275 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:30:08,275 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:30:08,275 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:30:08,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:30:08,275 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:30:08,276 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:30:08,276 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:30:08,277 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:30:08,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:30:08,325 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:30:08,329 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:30:08,331 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:30:08,331 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:30:08,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:30:08,522 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:30:08,526 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:30:08,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:30:08,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:30:08,533 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:30:08,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:30:08" (1/1) ... [2018-01-21 00:30:08,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa56ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:08, skipping insertion in model container [2018-01-21 00:30:08,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:30:08" (1/1) ... [2018-01-21 00:30:08,552 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:30:08,592 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:30:08,715 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:30:08,731 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:30:08,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:08 WrapperNode [2018-01-21 00:30:08,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:30:08,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:30:08,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:30:08,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:30:08,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:08" (1/1) ... [2018-01-21 00:30:08,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:08" (1/1) ... [2018-01-21 00:30:08,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:08" (1/1) ... [2018-01-21 00:30:08,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:08" (1/1) ... [2018-01-21 00:30:08,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:08" (1/1) ... [2018-01-21 00:30:08,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:08" (1/1) ... [2018-01-21 00:30:08,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:08" (1/1) ... [2018-01-21 00:30:08,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:30:08,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:30:08,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:30:08,772 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:30:08,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:08" (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:30:08,826 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:30:08,826 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:30:08,826 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-21 00:30:08,826 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:30:08,826 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:30:08,826 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:30:08,826 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:30:08,826 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:30:08,826 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:30:08,827 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:30:08,827 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-21 00:30:08,827 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:30:08,827 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:30:08,827 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:30:09,089 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:30:09,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:30:09 BoogieIcfgContainer [2018-01-21 00:30:09,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:30:09,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:30:09,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:30:09,092 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:30:09,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:30:08" (1/3) ... [2018-01-21 00:30:09,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f79df69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:30:09, skipping insertion in model container [2018-01-21 00:30:09,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:08" (2/3) ... [2018-01-21 00:30:09,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f79df69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:30:09, skipping insertion in model container [2018-01-21 00:30:09,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:30:09" (3/3) ... [2018-01-21 00:30:09,096 INFO L105 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:30:09,102 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:30:09,107 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:30:09,153 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:09,154 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:09,154 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:09,154 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:09,154 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:09,154 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:09,154 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:09,155 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:30:09,155 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 00:30:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:30:09,182 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:09,183 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:30:09,184 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:30:09,189 INFO L82 PathProgramCache]: Analyzing trace with hash 147035, now seen corresponding path program 1 times [2018-01-21 00:30:09,191 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:09,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:09,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:09,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:09,238 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:09,286 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:30:09,291 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:09,297 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:09,297 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:09,297 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:09,297 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:09,297 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:09,297 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:09,297 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:09,297 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == lisErr0EnsuresViolation======== [2018-01-21 00:30:09,297 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 00:30:09,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:30:09,300 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:09,300 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] [2018-01-21 00:30:09,300 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr0EnsuresViolation]=== [2018-01-21 00:30:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash -532715498, now seen corresponding path program 1 times [2018-01-21 00:30:09,301 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:09,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:09,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:09,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:09,302 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:09,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:09,388 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:30:09,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:09,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:30:09,391 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:09,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:30:09,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:30:09,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:09,489 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-21 00:30:09,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:09,512 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2018-01-21 00:30:09,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:30:09,513 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-21 00:30:09,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:09,522 INFO L225 Difference]: With dead ends: 109 [2018-01-21 00:30:09,522 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 00:30:09,525 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:30:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 00:30:09,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 00:30:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 00:30:09,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-01-21 00:30:09,556 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 26 [2018-01-21 00:30:09,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:09,556 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-01-21 00:30:09,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:30:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-01-21 00:30:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 00:30:09,558 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:09,558 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] [2018-01-21 00:30:09,558 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr0EnsuresViolation]=== [2018-01-21 00:30:09,558 INFO L82 PathProgramCache]: Analyzing trace with hash 200361856, now seen corresponding path program 1 times [2018-01-21 00:30:09,558 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:09,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:09,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:09,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:09,560 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:09,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:09,703 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:30:09,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:09,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:30:09,704 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:09,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:30:09,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:30:09,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:30:09,706 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 6 states. [2018-01-21 00:30:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:09,860 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2018-01-21 00:30:09,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 00:30:09,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-21 00:30:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:09,862 INFO L225 Difference]: With dead ends: 100 [2018-01-21 00:30:09,862 INFO L226 Difference]: Without dead ends: 66 [2018-01-21 00:30:09,863 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:30:09,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-21 00:30:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-01-21 00:30:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-21 00:30:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-01-21 00:30:09,872 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 29 [2018-01-21 00:30:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:09,872 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-01-21 00:30:09,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:30:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-01-21 00:30:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-21 00:30:09,874 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:09,874 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:09,874 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr0EnsuresViolation]=== [2018-01-21 00:30:09,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1926411264, now seen corresponding path program 1 times [2018-01-21 00:30:09,875 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:09,876 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:09,876 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:09,876 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:09,876 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:09,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-21 00:30:10,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:10,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:30:10,194 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:10,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 00:30:10,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 00:30:10,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-21 00:30:10,195 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 7 states. [2018-01-21 00:30:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:10,277 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-01-21 00:30:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:30:10,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-21 00:30:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:10,278 INFO L225 Difference]: With dead ends: 58 [2018-01-21 00:30:10,278 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:30:10,279 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-21 00:30:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:30:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:30:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:30:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:30:10,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-01-21 00:30:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:10,280 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:30:10,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 00:30:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:30:10,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:30:10,283 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:10,283 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:10,283 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:10,283 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:10,283 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:10,283 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:10,283 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:10,283 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:30:10,283 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 00:30:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 00:30:10,286 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:10,286 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:30:10,286 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:10,287 INFO L82 PathProgramCache]: Analyzing trace with hash 925461465, now seen corresponding path program 1 times [2018-01-21 00:30:10,287 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:10,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:10,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:10,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:10,288 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:10,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:10,312 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:30:10,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:10,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:30:10,313 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:10,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:30:10,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:30:10,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:10,314 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-21 00:30:10,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:10,321 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2018-01-21 00:30:10,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:30:10,321 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-01-21 00:30:10,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:10,323 INFO L225 Difference]: With dead ends: 109 [2018-01-21 00:30:10,323 INFO L226 Difference]: Without dead ends: 61 [2018-01-21 00:30:10,324 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:30:10,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-21 00:30:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-21 00:30:10,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-21 00:30:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-01-21 00:30:10,331 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 33 [2018-01-21 00:30:10,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:10,332 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-01-21 00:30:10,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:30:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-01-21 00:30:10,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-21 00:30:10,333 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:10,334 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] [2018-01-21 00:30:10,334 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash -609533649, now seen corresponding path program 1 times [2018-01-21 00:30:10,334 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:10,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:10,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:10,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:10,336 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:10,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:10,405 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:30:10,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:10,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:30:10,406 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:10,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:30:10,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:30:10,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:30:10,407 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 6 states. [2018-01-21 00:30:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:10,559 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2018-01-21 00:30:10,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 00:30:10,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-21 00:30:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:10,561 INFO L225 Difference]: With dead ends: 128 [2018-01-21 00:30:10,561 INFO L226 Difference]: Without dead ends: 73 [2018-01-21 00:30:10,561 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:30:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-21 00:30:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2018-01-21 00:30:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-21 00:30:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-01-21 00:30:10,569 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 36 [2018-01-21 00:30:10,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:10,569 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-01-21 00:30:10,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:30:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-01-21 00:30:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 00:30:10,571 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:10,571 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-21 00:30:10,571 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash 355386543, now seen corresponding path program 1 times [2018-01-21 00:30:10,572 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:10,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:10,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:10,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:10,573 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:10,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:30:11,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:30:11,179 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:30:11,180 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-01-21 00:30:11,182 INFO L201 CegarAbsIntRunner]: [0], [1], [3], [4], [5], [6], [7], [11], [14], [16], [17], [18], [20], [24], [28], [31], [73], [77], [80], [82], [83], [90], [92], [96], [97], [98], [99], [100], [101], [106], [107], [112], [114], [115], [117], [118], [119], [120], [122], [123], [124], [125], [126], [127] [2018-01-21 00:30:11,233 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:30:11,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:30:11,601 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:30:11,603 INFO L268 AbstractInterpreter]: Visited 44 different actions 93 times. Merged at 22 different actions 45 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 31 variables. [2018-01-21 00:30:11,624 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:30:11,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:30:11,624 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 00:30:11,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:11,647 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:30:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:11,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:30:11,757 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-21 00:30:11,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:11,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:11,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-21 00:30:11,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:30:11,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:30:11,822 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-21 00:30:11,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:11,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:11,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-21 00:30:11,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-21 00:30:11,889 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 12 treesize of output 11 [2018-01-21 00:30:11,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:11,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:11,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:11,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-21 00:30:11,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-21 00:30:11,953 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 8 treesize of output 7 [2018-01-21 00:30:11,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:11,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:11,965 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-21 00:30:11,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-21 00:30:12,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-21 00:30:12,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-01-21 00:30:12,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-01-21 00:30:12,081 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,087 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-01-21 00:30:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:30:12,121 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:30:12,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-01-21 00:30:12,250 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-21 00:30:12,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,264 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 25 treesize of output 23 [2018-01-21 00:30:12,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 1 [2018-01-21 00:30:12,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,271 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-21 00:30:12,278 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-01-21 00:30:12,278 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-21 00:30:12,281 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:30:12,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-01-21 00:30:12,316 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 5 xjuncts. [2018-01-21 00:30:12,316 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:43, output treesize:37 [2018-01-21 00:30:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:30:12,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:30:12,456 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 00:30:12,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:12,460 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:30:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:12,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:30:12,579 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-21 00:30:12,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-21 00:30:12,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:30:12,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:30:12,591 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-21 00:30:12,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-21 00:30:12,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-21 00:30:12,607 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 12 treesize of output 11 [2018-01-21 00:30:12,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-21 00:30:12,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-21 00:30:12,625 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 8 treesize of output 7 [2018-01-21 00:30:12,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,634 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-21 00:30:12,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-21 00:30:12,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-21 00:30:12,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-01-21 00:30:12,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-01-21 00:30:12,661 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,665 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-01-21 00:30:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:30:12,685 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:30:12,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-01-21 00:30:12,726 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-21 00:30:12,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,740 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-21 00:30:12,746 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-01-21 00:30:12,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-21 00:30:12,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:30:12,752 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 25 treesize of output 23 [2018-01-21 00:30:12,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 1 [2018-01-21 00:30:12,755 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,758 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:30:12,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-01-21 00:30:12,789 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 5 xjuncts. [2018-01-21 00:30:12,790 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:43, output treesize:37 [2018-01-21 00:30:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:30:12,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:30:12,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11, 11, 11] total 34 [2018-01-21 00:30:12,870 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:30:12,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-21 00:30:12,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-21 00:30:12,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2018-01-21 00:30:12,871 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 25 states. [2018-01-21 00:30:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:13,574 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2018-01-21 00:30:13,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-21 00:30:13,575 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-01-21 00:30:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:13,578 INFO L225 Difference]: With dead ends: 137 [2018-01-21 00:30:13,578 INFO L226 Difference]: Without dead ends: 116 [2018-01-21 00:30:13,579 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 163 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=334, Invalid=1472, Unknown=0, NotChecked=0, Total=1806 [2018-01-21 00:30:13,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-21 00:30:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2018-01-21 00:30:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-21 00:30:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-01-21 00:30:13,590 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 46 [2018-01-21 00:30:13,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:13,590 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-01-21 00:30:13,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-21 00:30:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-01-21 00:30:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 00:30:13,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:13,593 INFO L322 BasicCegarLoop]: trace histogram [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-21 00:30:13,593 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:13,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1901286964, now seen corresponding path program 1 times [2018-01-21 00:30:13,593 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:13,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:13,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:13,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:13,594 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:13,645 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:30:13,656 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:13,666 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:13,667 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:13,667 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:13,687 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:13,687 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:13,687 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:13,687 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:13,687 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:13,688 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:13,688 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:13,688 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:30:13,688 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 00:30:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 00:30:13,691 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:13,691 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:30:13,691 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:30:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash 304873293, now seen corresponding path program 1 times [2018-01-21 00:30:13,691 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:13,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:13,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:13,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:13,693 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:13,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:13,709 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:30:13,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:13,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:30:13,709 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:13,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:30:13,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:30:13,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:13,710 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-21 00:30:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:13,713 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2018-01-21 00:30:13,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:30:13,713 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-01-21 00:30:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:13,714 INFO L225 Difference]: With dead ends: 109 [2018-01-21 00:30:13,714 INFO L226 Difference]: Without dead ends: 59 [2018-01-21 00:30:13,715 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:30:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-21 00:30:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-21 00:30:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-21 00:30:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-01-21 00:30:13,720 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 31 [2018-01-21 00:30:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:13,720 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-01-21 00:30:13,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:30:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-01-21 00:30:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 00:30:13,721 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:13,722 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] [2018-01-21 00:30:13,722 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:30:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash -894488029, now seen corresponding path program 1 times [2018-01-21 00:30:13,722 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:13,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:13,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:13,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:13,723 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:13,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:13,808 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:30:13,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:13,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:30:13,808 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:13,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:30:13,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:30:13,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:30:13,809 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2018-01-21 00:30:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:14,033 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2018-01-21 00:30:14,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 00:30:14,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-21 00:30:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:14,034 INFO L225 Difference]: With dead ends: 124 [2018-01-21 00:30:14,035 INFO L226 Difference]: Without dead ends: 71 [2018-01-21 00:30:14,035 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:30:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-21 00:30:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2018-01-21 00:30:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-21 00:30:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-01-21 00:30:14,040 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 34 [2018-01-21 00:30:14,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:14,040 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-01-21 00:30:14,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:30:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-01-21 00:30:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-21 00:30:14,042 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:14,042 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-21 00:30:14,042 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:30:14,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1371695709, now seen corresponding path program 1 times [2018-01-21 00:30:14,042 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:14,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:14,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:14,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:14,044 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:14,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-21 00:30:14,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:14,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:30:14,125 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:14,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:30:14,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:30:14,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:30:14,126 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 4 states. [2018-01-21 00:30:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:14,171 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-01-21 00:30:14,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:30:14,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-01-21 00:30:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:14,172 INFO L225 Difference]: With dead ends: 63 [2018-01-21 00:30:14,172 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:30:14,172 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:30:14,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:30:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:30:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:30:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:30:14,173 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-01-21 00:30:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:14,173 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:30:14,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:30:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:30:14,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:30:14,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:30:14 BoogieIcfgContainer [2018-01-21 00:30:14,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:30:14,176 INFO L168 Benchmark]: Toolchain (without parser) took 5653.87 ms. Allocated memory was 302.0 MB in the beginning and 515.9 MB in the end (delta: 213.9 MB). Free memory was 261.9 MB in the beginning and 326.7 MB in the end (delta: -64.8 MB). Peak memory consumption was 149.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:14,177 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 302.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:30:14,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.18 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 250.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:14,177 INFO L168 Benchmark]: Boogie Preprocessor took 31.51 ms. Allocated memory is still 302.0 MB. Free memory was 250.8 MB in the beginning and 248.8 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:30:14,177 INFO L168 Benchmark]: RCFGBuilder took 318.46 ms. Allocated memory is still 302.0 MB. Free memory was 248.8 MB in the beginning and 228.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:14,178 INFO L168 Benchmark]: TraceAbstraction took 5084.66 ms. Allocated memory was 302.0 MB in the beginning and 515.9 MB in the end (delta: 213.9 MB). Free memory was 228.8 MB in the beginning and 326.7 MB in the end (delta: -97.9 MB). Peak memory consumption was 116.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:14,179 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 302.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.18 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 250.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.51 ms. Allocated memory is still 302.0 MB. Free memory was 250.8 MB in the beginning and 248.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 318.46 ms. Allocated memory is still 302.0 MB. Free memory was 248.8 MB in the beginning and 228.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5084.66 ms. Allocated memory was 302.0 MB in the beginning and 515.9 MB in the end (delta: 213.9 MB). Free memory was 228.8 MB in the beginning and 326.7 MB in the end (delta: -97.9 MB). Peak memory consumption was 116.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 42 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 534 LocStat_NO_SUPPORTING_DISEQUALITIES : 131 LocStat_NO_DISJUNCTIONS : -84 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 50 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 71 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 50 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.111516 RENAME_VARIABLES(MILLISECONDS) : 0.030204 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.702013 PROJECTAWAY(MILLISECONDS) : 2.009599 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001558 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.049078 ADD_EQUALITY(MILLISECONDS) : 0.035291 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.022323 #CONJOIN_DISJUNCTIVE : 126 #RENAME_VARIABLES : 239 #UNFREEZE : 0 #CONJOIN : 182 #PROJECTAWAY : 186 #ADD_WEAK_EQUALITY : 14 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 239 #ADD_EQUALITY : 73 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * 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, 65 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=65occurred 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: lisErr0EnsuresViolation CFG has 4 procedures, 65 locations, 4 error locations. SAFE Result, 0.9s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 169 SDtfs, 155 SDslu, 223 SDs, 0 SdLazy, 110 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 15645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4/4 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: [L557] int array_size = __VERIFIER_nondet_int(); [L558] COND FALSE !(array_size < 1 || array_size >= 2147483647 / sizeof(int)) VAL [array_size=1] [L561] EXPR, FCALL __builtin_alloca (array_size * sizeof(int)) VAL [__builtin_alloca (array_size * sizeof(int))={7:0}, array_size=1] [L561] int* numbers = (int*) __builtin_alloca (array_size * sizeof(int)); VAL [__builtin_alloca (array_size * sizeof(int))={7:0}, array_size=1, numbers={7:0}] [L562] CALL, EXPR lis(numbers, array_size) VAL [\old(N)=1, a={7:0}] [L542] int *best, *prev, i, j, max = 0; VAL [\old(N)=1, a={7:0}, a={7:0}, max=0, N=1] [L543] EXPR, FCALL __builtin_alloca (sizeof(int) * N) VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, max=0, N=1] [L543] best = (int*) __builtin_alloca (sizeof(int) * N) VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, max=0, N=1] [L544] EXPR, FCALL __builtin_alloca (sizeof(int) * N) VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, max=0, N=1] [L544] prev = (int*) __builtin_alloca (sizeof(int) * N) [L545] i = 0 VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=0, max=0, N=1, prev={6:0}] [L545] COND TRUE i < N VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=0, max=0, N=1, prev={6:0}] [L546] FCALL best[i] = 1 VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=0, max=0, N=1, prev={6:0}] [L546] FCALL prev[i] = i VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=0, max=0, N=1, prev={6:0}] [L545] i++ VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=0, N=1, prev={6:0}] [L545] COND FALSE !(i < N) VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=0, N=1, prev={6:0}] [L547] i = 1 VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=0, N=1, prev={6:0}] [L547] COND FALSE !(i < N) VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=0, N=1, prev={6:0}] [L551] i = 0 VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=0, max=0, N=1, prev={6:0}] [L551] COND TRUE i < N VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=0, max=0, N=1, prev={6:0}] [L552] EXPR, FCALL best[i] VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, best[i]=1, i=0, max=0, N=1, prev={6:0}] [L552] COND TRUE max < best[i] [L553] EXPR, FCALL best[i] VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, best[i]=1, i=0, max=0, N=1, prev={6:0}] [L553] max = best[i] [L551] i++ VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=1, N=1, prev={6:0}] [L551] COND FALSE !(i < N) VAL [\old(N)=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=1, N=1, prev={6:0}] [L554] RET return max; VAL [\old(N)=1, \result=1, __builtin_alloca (sizeof(int) * N)={6:0}, __builtin_alloca (sizeof(int) * N)={8:0}, a={7:0}, a={7:0}, best={8:0}, i=1, max=1, N=1, prev={6:0}] [L562] EXPR lis(numbers, array_size) VAL [__builtin_alloca (array_size * sizeof(int))={7:0}, array_size=1, lis(numbers, array_size)=1, numbers={7:0}] [L562] return lis(numbers, array_size); - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 65 locations, 4 error locations. UNSAFE Result, 3.4s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 172 SDtfs, 631 SDslu, 620 SDs, 0 SdLazy, 570 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 167 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 292 ConstructedInterpolants, 26 QuantifiedInterpolants, 77779 SizeOfPredicates, 28 NumberOfNonLiveVariables, 260 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 8/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 556]: 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, 65 locations, 4 error locations. SAFE Result, 0.4s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 181 SDtfs, 177 SDslu, 221 SDs, 0 SdLazy, 102 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 7016 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4/4 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/lis-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-30-14-191.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_00-30-14-191.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_00-30-14-191.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-30-14-191.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-30-14-191.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-30-14-191.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-30-14-191.csv Received shutdown request...