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.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:24:42,624 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:24:42,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:24:42,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:24:42,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:24:42,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:24:42,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:24:42,645 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:24:42,647 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:24:42,648 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:24:42,649 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:24:42,649 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:24:42,650 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:24:42,651 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:24:42,653 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:24:42,655 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:24:42,658 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:24:42,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:24:42,661 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:24:42,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:24:42,665 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:24:42,665 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:24:42,665 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:24:42,666 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:24:42,667 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:24:42,669 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:24:42,669 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:24:42,670 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:24:42,670 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:24:42,670 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:24:42,671 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:24:42,671 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.epf [2018-01-20 23:24:42,681 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:24:42,681 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:24:42,682 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:24:42,682 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:24:42,682 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:24:42,682 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:24:42,682 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:24:42,683 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:24:42,683 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:24:42,683 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:24:42,683 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:24:42,683 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:24:42,683 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:24:42,683 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:24:42,684 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:24:42,684 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:24:42,684 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:24:42,684 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:24:42,684 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:24:42,684 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:24:42,684 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:24:42,684 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:24:42,685 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:24:42,685 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:24:42,685 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:24:42,685 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:24:42,685 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:24:42,686 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:24:42,686 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:24:42,686 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:24:42,686 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:24:42,686 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:24:42,686 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:24:42,686 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:24:42,687 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:24:42,687 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:24:42,687 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:24:42,687 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:24:42,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:24:42,732 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:24:42,735 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:24:42,736 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:24:42,737 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:24:42,737 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-20 23:24:42,912 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:24:42,916 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:24:42,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:24:42,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:24:42,923 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:24:42,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:24:42" (1/1) ... [2018-01-20 23:24:42,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793dbc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:42, skipping insertion in model container [2018-01-20 23:24:42,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:24:42" (1/1) ... [2018-01-20 23:24:42,941 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:24:42,979 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:24:43,101 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:24:43,123 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:24:43,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:43 WrapperNode [2018-01-20 23:24:43,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:24:43,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:24:43,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:24:43,133 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:24:43,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:43" (1/1) ... [2018-01-20 23:24:43,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:43" (1/1) ... [2018-01-20 23:24:43,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:43" (1/1) ... [2018-01-20 23:24:43,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:43" (1/1) ... [2018-01-20 23:24:43,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:43" (1/1) ... [2018-01-20 23:24:43,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:43" (1/1) ... [2018-01-20 23:24:43,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:43" (1/1) ... [2018-01-20 23:24:43,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:24:43,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:24:43,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:24:43,175 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:24:43,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:43" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:24:43,253 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:24:43,253 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:24:43,253 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-20 23:24:43,253 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:24:43,253 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 23:24:43,253 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 23:24:43,253 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:24:43,254 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:24:43,254 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:24:43,254 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:24:43,254 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-20 23:24:43,254 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:24:43,254 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:24:43,254 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:24:43,493 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:24:43,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:24:43 BoogieIcfgContainer [2018-01-20 23:24:43,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:24:43,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:24:43,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:24:43,497 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:24:43,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:24:42" (1/3) ... [2018-01-20 23:24:43,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21851c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:24:43, skipping insertion in model container [2018-01-20 23:24:43,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:43" (2/3) ... [2018-01-20 23:24:43,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21851c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:24:43, skipping insertion in model container [2018-01-20 23:24:43,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:24:43" (3/3) ... [2018-01-20 23:24:43,500 INFO L105 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-01-20 23:24:43,506 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:24:43,512 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 23:24:43,556 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:43,557 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:43,557 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:43,557 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:43,557 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:43,557 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:43,557 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:43,557 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:24:43,558 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 23:24:43,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:24:43,581 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:43,582 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:24:43,582 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:24:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash 147035, now seen corresponding path program 1 times [2018-01-20 23:24:43,588 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:43,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:43,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:43,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:43,628 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:43,682 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:24:43,689 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:43,697 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:43,697 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:43,697 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:43,697 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:43,697 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:43,698 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:43,698 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:43,698 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == lisErr0EnsuresViolation======== [2018-01-20 23:24:43,698 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 23:24:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 23:24:43,703 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:43,703 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-20 23:24:43,704 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr0EnsuresViolation]=== [2018-01-20 23:24:43,704 INFO L82 PathProgramCache]: Analyzing trace with hash -532715498, now seen corresponding path program 1 times [2018-01-20 23:24:43,704 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:43,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:43,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:43,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:43,706 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:43,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:43,799 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-20 23:24:43,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:43,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:24:43,801 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:43,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:24:43,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:24:43,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:24:43,895 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-20 23:24:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:43,919 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2018-01-20 23:24:43,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:24:43,921 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-20 23:24:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:43,930 INFO L225 Difference]: With dead ends: 109 [2018-01-20 23:24:43,930 INFO L226 Difference]: Without dead ends: 54 [2018-01-20 23:24:43,932 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-20 23:24:43,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-20 23:24:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-20 23:24:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-20 23:24:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-01-20 23:24:43,966 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 26 [2018-01-20 23:24:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:43,966 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-01-20 23:24:43,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:24:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-01-20 23:24:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 23:24:43,968 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:43,968 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-20 23:24:43,968 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr0EnsuresViolation]=== [2018-01-20 23:24:43,968 INFO L82 PathProgramCache]: Analyzing trace with hash 200361856, now seen corresponding path program 1 times [2018-01-20 23:24:43,969 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:43,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:43,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:43,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:43,970 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:43,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:44,121 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-20 23:24:44,122 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:44,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 23:24:44,122 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:44,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:24:44,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:24:44,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:24:44,125 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 6 states. [2018-01-20 23:24:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:44,347 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2018-01-20 23:24:44,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 23:24:44,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-20 23:24:44,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:44,349 INFO L225 Difference]: With dead ends: 100 [2018-01-20 23:24:44,349 INFO L226 Difference]: Without dead ends: 66 [2018-01-20 23:24:44,351 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-20 23:24:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-20 23:24:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-01-20 23:24:44,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-20 23:24:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-01-20 23:24:44,360 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 29 [2018-01-20 23:24:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:44,361 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-01-20 23:24:44,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:24:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-01-20 23:24:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-20 23:24:44,362 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:44,362 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-20 23:24:44,363 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr0EnsuresViolation]=== [2018-01-20 23:24:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1926411264, now seen corresponding path program 1 times [2018-01-20 23:24:44,363 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:44,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:44,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:44,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:44,364 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:44,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:44,643 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-20 23:24:44,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:44,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 23:24:44,644 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:44,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 23:24:44,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 23:24:44,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-20 23:24:44,645 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 7 states. [2018-01-20 23:24:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:44,749 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-01-20 23:24:44,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 23:24:44,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-20 23:24:44,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:44,750 INFO L225 Difference]: With dead ends: 58 [2018-01-20 23:24:44,750 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:24:44,751 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-20 23:24:44,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:24:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:24:44,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:24:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:24:44,752 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-01-20 23:24:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:44,752 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:24:44,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 23:24:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:24:44,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:24:44,755 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:44,755 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:44,755 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:44,755 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:44,755 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:44,756 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:44,756 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:44,756 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:24:44,756 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 23:24:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-20 23:24:44,758 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:44,759 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-20 23:24:44,759 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:44,759 INFO L82 PathProgramCache]: Analyzing trace with hash 925461465, now seen corresponding path program 1 times [2018-01-20 23:24:44,759 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:44,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:44,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:44,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:44,760 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:44,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:44,786 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-20 23:24:44,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:44,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:24:44,787 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:44,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:24:44,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:24:44,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:24:44,788 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-20 23:24:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:44,795 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2018-01-20 23:24:44,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:24:44,795 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-01-20 23:24:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:44,796 INFO L225 Difference]: With dead ends: 109 [2018-01-20 23:24:44,797 INFO L226 Difference]: Without dead ends: 61 [2018-01-20 23:24:44,797 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-20 23:24:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-20 23:24:44,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-20 23:24:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-20 23:24:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-01-20 23:24:44,803 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 33 [2018-01-20 23:24:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:44,804 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-01-20 23:24:44,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:24:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-01-20 23:24:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-20 23:24:44,805 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:44,805 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-20 23:24:44,805 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:44,805 INFO L82 PathProgramCache]: Analyzing trace with hash -609533649, now seen corresponding path program 1 times [2018-01-20 23:24:44,805 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:44,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:44,806 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:44,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:44,807 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:44,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:44,888 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-20 23:24:44,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:44,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 23:24:44,888 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:44,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:24:44,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:24:44,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:24:44,889 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 6 states. [2018-01-20 23:24:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:45,048 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2018-01-20 23:24:45,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 23:24:45,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-20 23:24:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:45,050 INFO L225 Difference]: With dead ends: 128 [2018-01-20 23:24:45,050 INFO L226 Difference]: Without dead ends: 73 [2018-01-20 23:24:45,050 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-20 23:24:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-20 23:24:45,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2018-01-20 23:24:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-20 23:24:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-01-20 23:24:45,056 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 36 [2018-01-20 23:24:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:45,056 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-01-20 23:24:45,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:24:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-01-20 23:24:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-20 23:24:45,057 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:45,057 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-20 23:24:45,058 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash 355386543, now seen corresponding path program 1 times [2018-01-20 23:24:45,058 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:45,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:45,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:45,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:45,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:45,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:45,676 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-20 23:24:45,676 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:24:45,676 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:24:45,677 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-01-20 23:24:45,679 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-20 23:24:45,736 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:24:45,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:24:59,848 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-20 23:24:59,850 INFO L268 AbstractInterpreter]: Visited 44 different actions 140 times. Merged at 22 different actions 88 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 3 different actions. Largest state had 31 variables. [2018-01-20 23:24:59,868 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-20 23:24:59,868 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:24:59,868 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-20 23:24:59,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:59,878 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:24:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:59,916 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:24:59,961 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-20 23:24:59,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 23:24:59,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:24:59,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 23:25:00,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:25:00,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:25:00,004 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-20 23:25:00,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-20 23:25:00,060 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-20 23:25:00,064 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-20 23:25:00,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-20 23:25:00,125 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-20 23:25:00,130 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-20 23:25:00,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,146 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-20 23:25:00,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-20 23:25:00,244 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-20 23:25:00,247 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-20 23:25:00,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,255 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-20 23:25:00,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,265 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-20 23:25:00,265 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-01-20 23:25:00,301 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-20 23:25:00,301 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:25:00,430 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-20 23:25:00,446 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-20 23:25:00,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,461 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-20 23:25:00,463 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-20 23:25:00,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,468 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-20 23:25:00,474 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-20 23:25:00,475 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-20 23:25:00,478 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:25:00,492 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-20 23:25:00,526 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-20 23:25:00,526 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:43, output treesize:37 [2018-01-20 23:25:00,627 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-20 23:25:00,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:25:00,646 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-20 23:25:00,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:25:00,650 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:25:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:25:00,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:25:00,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-20 23:25:00,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 23:25:00,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:25:00,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 23:25:00,765 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-20 23:25:00,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-20 23:25:00,772 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-20 23:25:00,773 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-20 23:25:00,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-20 23:25:00,786 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-20 23:25:00,787 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-20 23:25:00,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,796 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-20 23:25:00,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-20 23:25:00,814 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-20 23:25:00,816 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-20 23:25:00,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,820 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-20 23:25:00,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,825 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-20 23:25:00,825 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-01-20 23:25:00,843 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-20 23:25:00,844 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:25:00,863 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-20 23:25:00,882 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-20 23:25:00,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,897 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-20 23:25:00,902 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-20 23:25:00,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 23:25:00,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 23:25:00,907 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-20 23:25:00,908 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-20 23:25:00,909 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,911 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 23:25:00,922 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-20 23:25:00,940 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-20 23:25:00,940 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:43, output treesize:37 [2018-01-20 23:25:00,986 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-20 23:25:00,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-20 23:25:00,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11, 11, 11] total 34 [2018-01-20 23:25:00,988 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-20 23:25:00,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-20 23:25:00,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-20 23:25:00,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2018-01-20 23:25:00,989 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 25 states. [2018-01-20 23:25:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:25:01,701 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2018-01-20 23:25:01,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-20 23:25:01,701 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-01-20 23:25:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:25:01,704 INFO L225 Difference]: With dead ends: 137 [2018-01-20 23:25:01,704 INFO L226 Difference]: Without dead ends: 116 [2018-01-20 23:25:01,705 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-20 23:25:01,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-20 23:25:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2018-01-20 23:25:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-20 23:25:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-01-20 23:25:01,712 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 46 [2018-01-20 23:25:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:25:01,712 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-01-20 23:25:01,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-20 23:25:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-01-20 23:25:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-20 23:25:01,714 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:25:01,714 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-20 23:25:01,714 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:25:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1901286964, now seen corresponding path program 1 times [2018-01-20 23:25:01,715 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:25:01,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:25:01,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:25:01,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:25:01,716 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:25:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:25:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:25:01,762 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:25:01,776 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:25:01,787 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:25:01,788 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:25:01,789 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:25:01,809 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:25:01,809 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:25:01,809 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:25:01,809 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:25:01,809 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:25:01,809 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:25:01,809 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:25:01,809 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:25:01,809 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:25:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 23:25:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-20 23:25:01,812 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:25:01,812 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-20 23:25:01,812 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:25:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash 304873293, now seen corresponding path program 1 times [2018-01-20 23:25:01,812 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:25:01,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:25:01,813 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:25:01,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:25:01,813 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:25:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:25:01,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:25:01,830 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-20 23:25:01,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:25:01,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:25:01,831 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:25:01,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:25:01,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:25:01,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:25:01,832 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-20 23:25:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:25:01,834 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2018-01-20 23:25:01,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:25:01,835 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-01-20 23:25:01,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:25:01,836 INFO L225 Difference]: With dead ends: 109 [2018-01-20 23:25:01,836 INFO L226 Difference]: Without dead ends: 59 [2018-01-20 23:25:01,836 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-20 23:25:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-20 23:25:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-20 23:25:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-20 23:25:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-01-20 23:25:01,841 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 31 [2018-01-20 23:25:01,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:25:01,841 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-01-20 23:25:01,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:25:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-01-20 23:25:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 23:25:01,842 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:25:01,842 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-20 23:25:01,843 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 23:25:01,843 INFO L82 PathProgramCache]: Analyzing trace with hash -894488029, now seen corresponding path program 1 times [2018-01-20 23:25:01,843 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:25:01,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:25:01,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:25:01,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:25:01,844 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:25:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:25:01,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:25:01,918 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-20 23:25:01,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:25:01,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 23:25:01,919 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:25:01,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:25:01,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:25:01,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:25:01,920 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2018-01-20 23:25:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:25:01,992 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2018-01-20 23:25:01,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 23:25:01,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-20 23:25:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:25:01,993 INFO L225 Difference]: With dead ends: 124 [2018-01-20 23:25:01,994 INFO L226 Difference]: Without dead ends: 71 [2018-01-20 23:25:01,994 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-20 23:25:01,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-20 23:25:01,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2018-01-20 23:25:01,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-20 23:25:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-01-20 23:25:02,000 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 34 [2018-01-20 23:25:02,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:25:02,000 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-01-20 23:25:02,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:25:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-01-20 23:25:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-20 23:25:02,001 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:25:02,001 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-20 23:25:02,001 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 23:25:02,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1371695709, now seen corresponding path program 1 times [2018-01-20 23:25:02,001 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:25:02,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:25:02,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:25:02,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:25:02,003 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:25:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:25:02,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:25:02,082 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-20 23:25:02,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:25:02,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:25:02,082 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:25:02,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:25:02,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:25:02,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:25:02,083 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 4 states. [2018-01-20 23:25:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:25:02,112 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-01-20 23:25:02,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:25:02,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-01-20 23:25:02,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:25:02,113 INFO L225 Difference]: With dead ends: 63 [2018-01-20 23:25:02,113 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:25:02,113 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-20 23:25:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:25:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:25:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:25:02,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:25:02,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-01-20 23:25:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:25:02,114 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:25:02,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:25:02,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:25:02,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:25:02,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:25:02 BoogieIcfgContainer [2018-01-20 23:25:02,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:25:02,117 INFO L168 Benchmark]: Toolchain (without parser) took 19205.08 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 267.6 MB in the beginning and 960.4 MB in the end (delta: -692.8 MB). Peak memory consumption was 332.2 MB. Max. memory is 5.3 GB. [2018-01-20 23:25:02,118 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 309.3 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:25:02,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.50 ms. Allocated memory is still 309.3 MB. Free memory was 266.6 MB in the beginning and 256.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-20 23:25:02,118 INFO L168 Benchmark]: Boogie Preprocessor took 41.83 ms. Allocated memory is still 309.3 MB. Free memory was 256.5 MB in the beginning and 254.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:25:02,119 INFO L168 Benchmark]: RCFGBuilder took 319.20 ms. Allocated memory is still 309.3 MB. Free memory was 254.5 MB in the beginning and 234.8 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. [2018-01-20 23:25:02,119 INFO L168 Benchmark]: TraceAbstraction took 18621.63 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 234.8 MB in the beginning and 960.4 MB in the end (delta: -725.6 MB). Peak memory consumption was 299.4 MB. Max. memory is 5.3 GB. [2018-01-20 23:25:02,121 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.14 ms. Allocated memory is still 309.3 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.50 ms. Allocated memory is still 309.3 MB. Free memory was 266.6 MB in the beginning and 256.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.83 ms. Allocated memory is still 309.3 MB. Free memory was 256.5 MB in the beginning and 254.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 319.20 ms. Allocated memory is still 309.3 MB. Free memory was 254.5 MB in the beginning and 234.8 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 18621.63 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 234.8 MB in the beginning and 960.4 MB in the end (delta: -725.6 MB). Peak memory consumption was 299.4 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 : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 682 LocStat_NO_SUPPORTING_DISEQUALITIES : 171 LocStat_NO_DISJUNCTIONS : -84 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 50 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 71 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 50 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.766557 RENAME_VARIABLES(MILLISECONDS) : 0.010723 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.417045 PROJECTAWAY(MILLISECONDS) : 43.616495 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.086681 DISJOIN(MILLISECONDS) : 1.626968 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.020367 ADD_EQUALITY(MILLISECONDS) : 0.027381 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009482 #CONJOIN_DISJUNCTIVE : 254 #RENAME_VARIABLES : 519 #UNFREEZE : 0 #CONJOIN : 342 #PROJECTAWAY : 346 #ADD_WEAK_EQUALITY : 14 #DISJOIN : 37 #RENAME_VARIABLES_DISJUNCTIVE : 519 #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, 1.0s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.4s 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.2s 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, 17.0s 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.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 167 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.2s 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, 14.1s 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.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s 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.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s 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.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-25-02-132.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-20_23-25-02-132.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-20_23-25-02-132.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-25-02-132.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-25-02-132.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-25-02-132.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-25-02-132.csv Received shutdown request...